{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:18:21Z","timestamp":1742969901962,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_2","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T21:25:06Z","timestamp":1468963506000},"page":"13-25","source":"Crossref","is-referenced-by-count":0,"title":["Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"2_CR1","series-title":"Series in Algebra","volume-title":"Finite Semigroups and Universal Algebra","author":"J Almeida","year":"1994","unstructured":"Almeida, J.: Finite Semigroups and Universal Algebra. Series in Algebra, vol. 3. World Scientific, Singapore (1994)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-92687-0_5","volume-title":"Logical Foundations of Computer Science","author":"N Bedon","year":"2008","unstructured":"Bedon, N.: Logic and bounded-width rational languages of posets over countable scattered linear orderings. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 61\u201375. Springer, Heidelberg (2008)"},{"issue":"4:2","key":"2_CR3","first-page":"1","volume":"11","author":"N Bedon","year":"2015","unstructured":"Bedon, N.: Logic and branching automata. Log. Meth. Comput. Sci. 11(4:2), 1\u201338 (2015)","journal-title":"Log. Meth. Comput. Sci."},{"issue":"22","key":"2_CR4","doi-asserted-by":"crossref","first-page":"2356","DOI":"10.1016\/j.tcs.2011.01.016","volume":"412","author":"N Bedon","year":"2011","unstructured":"Bedon, N., Rispal, C.: Series-parallel languages on scattered and countable posets. Theor. Comput. Sci. 412(22), 2356\u20132369 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2006.10.009","volume":"73","author":"V Bruy\u00e8re","year":"2007","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. J. Comput. Syst. Sci. 73(1), 1\u201324 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR6","unstructured":"B\u00fcchi, J.R.: On a decision method in the restricted second-order arithmetic. In: Proceedings of International Congress on Logic, Methodology and Philosophy of Science, Berkeley 1960 (1962)"},{"key":"2_CR7","unstructured":"B\u00fcchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proceedings of International Congress on Logic, Methodology, and Philosophy of Science 1964 (1965)"},{"issue":"4","key":"2_CR8","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1142\/S0129054105003285","volume":"16","author":"O Carton","year":"2005","unstructured":"Carton, O., Rispal, C.: Complementation of rational sets on countable scattered linear orderings. Int. J. Found. Comput. Sci. 16(4), 767 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.tcs.2009.10.013","volume":"411","author":"T Colcombet","year":"2010","unstructured":"Colcombet, T.: Factorisation forests for infinite words and applications to countable scattered linear orderings. Theor. Comput. Sci. 411, 751\u2013764 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational sets in commutative monoids. J. Algebra 13(2), 173\u2013191 (1969)","journal-title":"J. Algebra"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1853, pp. 648\u2013662. Springer, Heidelberg (2000)"},{"key":"2_CR12","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 299, 347\u2013386 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-49382-2_33","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: A Kleene iteration for parallelism. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 355\u2013367. Springer, Heidelberg (1998)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1373, pp. 555\u2013565. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"2_CR15","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 237(1\u20132), 347\u2013380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/inco.2001.3077","volume":"171","author":"K Lodaya","year":"2001","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Inform. Comput. 171, 269\u2013293 (2001)","journal-title":"Inform. Comput."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of Fourth Annual Symposium on Switching circuit theory and logical design. IEEE (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"2_CR18","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"2_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1090\/S0002-9939-1983-0715851-3","volume":"89","author":"I Rival","year":"1983","unstructured":"Rival, I.: Optimal linear extension by interchanging chains. Proc. AMS 89(3), 387\u2013394 (1983)","journal-title":"Proc. AMS"},{"key":"2_CR20","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, New York (1982)"},{"key":"2_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"2_CR22","doi-asserted-by":"crossref","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, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR23","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1142\/S0218196793000287","volume":"3","author":"T Wilke","year":"1993","unstructured":"Wilke, T.: An algebraic theory for regular languages of finite and infinite words. Int. J. Algebra Comput. 3(4), 44\u2013489 (1993)","journal-title":"Int. J. Algebra Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53132-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:55Z","timestamp":1498315555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}