{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:18Z","timestamp":1725486498628},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434535"},{"type":"electronic","value":"9783540460114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46011-x_18","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:54:16Z","timestamp":1182207256000},"page":"217-227","source":"Crossref","is-referenced-by-count":5,"title":["Automata on Series-Parallel Biposets"],"prefix":"10.1007","author":[{"given":"Z.","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z. L.","family":"N\u00e9meth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","volume":"59","author":"G. Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: Concurrency and atomicity. Theoret. Comput. Sci. 59 (1988) 25\u201334.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlinham, L.S.: Complement reducible graphs. Discr. Appl. Math. 3 (1981) 163\u2013174.","journal-title":"Discr. Appl. Math."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic on graphs V: on closing the gap between definability and recognizability. Theoret. Comput. Sci. 80 (1991) 153\u2013202.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(94)00272-X","volume":"154","author":"J. Engelfriet","year":"1996","unstructured":"Engelfriet, J., Harju, T., Proskurowski, A., Rozenberg, G.: Characterization and complexity of uniformly nonprimitive labeled 2-structures. Theoret. Comput. Sci. 154 (1996) 247\u2013282.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1051\/ita\/1993270504331","volume":"27","author":"A. Ehrenfeucht","year":"1993","unstructured":"Ehrenfeucht, A., ten Pas, P., Rozenberg, G.: Combinatorial properties of texts. Theor. Inf. Appl. 27 (1993) 433\u2013464.","journal-title":"Theor. Inf. Appl."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, Part 1: clans, basic subclasses, and morphisms. Part 2: representation through labeled tree families. Theoret. Comput. Sci. 70 (1990) 277\u2013303, 305\u2013342.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(92)90313-5","volume":"92","author":"A. Ehrenfeucht","year":"1992","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Angular 2-structures. Theoret. Comput. Sci. 92 (1992) 227\u2013248.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0304-3975(93)90323-L","volume":"116","author":"A. Ehrenfeucht","year":"1993","unstructured":"Ehrenfeucht, A., Rozenberg, G.: T-structures, T-functions and texts. Theoret. Comput. Sci. 116 (1993) 227\u2013290.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR9","first-page":"52","volume-title":"RIMS Kokyuroku 1166","author":"Z. \u00c9sik","year":"2000","unstructured":"\u00c9sik, Z.: Free algebras for generalized automata and language theory. RIMS Kokyuroku 1166, Kyoto University, Kyoto (2000) 52\u201358."},{"key":"18_CR10","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fund. Inform. 25 (1996) 399\u2013422.","journal-title":"Fund. Inform."},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/3-540-57785-8_155","volume-title":"Monadic second order logic over pictures and recognizability by tiling systems","author":"D. Giammarresi","year":"1994","unstructured":"Giammarresi, D., Restivo, A., Seibert, S., Thomas, W.: Monadic second order logic over pictures and recognizability by tiling systems. In: proc. STACS 94, Caen, LNCS, Vol. 775. Springer (1994) 365\u2013375."},{"key":"18_CR13","first-page":"427","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fund. Inform. 4 (1981) 427\u2013498.","journal-title":"Fund. Inform."},{"key":"18_CR14","first-page":"219","volume":"5","author":"K. Hashiguchi","year":"2000","unstructured":"Hashiguchi, K., Ichihara, S., Jimbo, S.: Formal languages over free binoids. J. Autom. Lang. Comb. 5 (2000) 219\u2013234.","journal-title":"J. Autom. Lang. Comb."},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1996-253409","volume":"25","author":"H.J. Hoogeboom","year":"1996","unstructured":"Hoogeboom, H.J., ten Pas, P.: Text languages in an algebraic framework. Fund. Inform. 25 (1996) 353\u2013380.","journal-title":"Fund. Inform."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s002240000055","volume":"30","author":"H.J. Hoogeboom","year":"1997","unstructured":"Hoogeboom, H.J., ten Pas, P.: Monadic second-order definable text languages. Theory Comput. Syst. 30 (1997) 335\u2013354.","journal-title":"Theory Comput. Syst."},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1007\/3-540-45022-X_55","volume-title":"Infinite series-parallel posets: logic and languages","author":"D. Kuske","year":"2000","unstructured":"Kuske, D.: Infinite series-parallel posets: logic and languages. In: proc. ICALP 2000, LNCS, Vol. 1853. Springer (2001) 648\u2013662."},{"key":"18_CR18","unstructured":"Kuske, D.: Towards a language theory for infinite N-free pomsets. (to appear)."},{"key":"18_CR19","series-title":"Lect Notes Comput Sci","first-page":"355","volume-title":"Kleene iteration for parallelism","author":"K. Lodaya","year":"2004","unstructured":"Lodaya, K., Weil, P.: Kleene iteration for parallelism. In: proc. FST & TCS 98, LNCS, Vol. 1530. Springer-Verlag (1998) 355\u2013366."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoret. Comput. Sci. 237 (2000) 347\u2013380.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with series operation. Inform. and Comput. (to appear).","DOI":"10.1006\/inco.2001.3077"},{"key":"18_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.: Varieties of Formal Languages. Plenum Publishing Corp., NewYork (1986)."},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00010-3","volume":"205","author":"M. Steinby","year":"1998","unstructured":"Steinby, M.: General varieties of tree languages. Theoret. Comput. Sci. 205 (1998) 1\u201343.","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Automata, Formal Logic and Circuit Complexity","author":"H. Straubing","year":"1994","unstructured":"Straubing, H.: Automata, Formal Logic and Circuit Complexity. Birkhauser, Boston (1994)."},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series-parallel digraphs. SIAM J. Comput. 11 (1982) 298\u2013313.","journal-title":"SIAM J. Comput."},{"key":"18_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-63165-8_191","volume-title":"Star-free picture expressions are strictly weaker than first-order logic","author":"Th. Wilke","year":"1997","unstructured":"Wilke, Th.: Star-free picture expressions are strictly weaker than first-order logic. In: proc. ICALP 97, LNCS, Vol. 1256. Springer-Verlag (1997) 347\u2013357."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46011-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T04:40:48Z","timestamp":1587616848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46011-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434535","9783540460114"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46011-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}