{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T11:16:18Z","timestamp":1769598978518,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540744559","type":"print"},{"value":"9783540744566","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_43","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"477-488","source":"Crossref","is-referenced-by-count":3,"title":["Series-Parallel Languages on Scattered and Countable Posets"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[]},{"given":"Chlo\u00e9","family":"Rispal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Bedon, N., Rispal, C.: Recognizable languages and decidability of the monadic second-order logic on countable scattered linear orderings. In: Logical Methods in Computer Science (submitted, 2006)"},{"issue":"4\u20135\u20136","key":"43_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1051\/ita\/1998324-601751","volume":"32","author":"S.L. Bloom","year":"1998","unstructured":"Bloom, S.L., \u00c9sik, Z.: Shuffle binoids. Theoretical Informatics and Applications\u00a032(4\u20135\u20136), 175\u2013198 (1998)","journal-title":"Theoretical Informatics and Applications"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-45005-X_9","volume-title":"Developments in Language Theory","author":"V. Bruy\u00e8re","year":"2003","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 103\u2013115. Springer, Heidelberg (2003)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46011-X_18","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z., N\u00e9meth, Z.L.: Automata on series-parallel biposets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 217\u2013227. Springer, Heidelberg (2002)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-45022-X_55","volume-title":"Automata, Languages and Programming","author":"D. Kuske","year":"2000","unstructured":"Kuske, D.: Infinite series-parallel posets: logic and languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 648\u2013662. Springer, Heidelberg (2000)"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(02)00370-5","volume":"299","author":"D. Kuske","year":"2003","unstructured":"Kuske, D.: Towards a language theory for infinite N-free pomsets. Theoret. Comput. Sci.\u00a0299, 347\u2013386 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 1998","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: algebra, automata and languages. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 555\u2013565. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"43_CR8","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.\u00a0237(1\u20132), 347\u2013380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Information and Computation, 269\u2013293 (2001)","DOI":"10.1006\/inco.2001.3077"},{"issue":"3","key":"43_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.2307\/2045481","volume":"89","author":"I. Rival","year":"1983","unstructured":"Rival, I.: Optimal linear extension by interchanging chains. Proc. AMS\u00a089(3), 387\u2013394 (1983)","journal-title":"Proc. AMS"},{"key":"43_CR11","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, London (1982)"},{"key":"43_CR12","unstructured":"Valdes, J.: Parsing flowcharts and series-parallel graphs. Technical Report STAN-CS-78-682, Computer science departement of the Stanford University, Standford, Ca. (1978)"},{"key":"43_CR13","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.\u00a011, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:10Z","timestamp":1619519350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}