{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:07:54Z","timestamp":1725574074598},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_33","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"292-301","source":"Crossref","is-referenced-by-count":2,"title":["Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]},{"given":"Chlo\u00e9","family":"Rispal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, London (1974)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44683-4_21","volume-title":"Mathematical Foundations of Computer Science 2001","author":"V. Bruy\u00e8re","year":"2001","unstructured":"Bruy\u00e8re, V., Carton, O.: Automata on linear orderings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 236\u2013247. Springer, Heidelberg (2001) IGM report 2001-12"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Bruy\u00e8re, V., Carton, O.: Hierarchy among automata on linear orderings. In: IFIP TCS 2002, pp. 107\u2013118 (2002)","DOI":"10.1007\/978-0-387-35608-2_10"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","volume":"156","author":"N. Bedon","year":"1996","unstructured":"Bedon, N.: Finite automata and ordinals. Theoret. Comput. Sci.\u00a0156, 119\u2013144 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196798000028","volume":"8","author":"N. Bedon","year":"1998","unstructured":"Bedon, N.: Automata, semigroups and recognizability of words on ordinals. Int. J. Alg. Comput.\u00a08, 1\u201321 (1998)","journal-title":"Int. J. Alg. Comput."},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0054310","volume-title":"LATIN\u201998: Theoretical Informatics","author":"N. Bedon","year":"1998","unstructured":"Bedon, N., Carton, O.: An Eilenberg theorem for words on countable ordinals. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 53\u201364. Springer, Heidelberg (1998)"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik und grundl. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik und grundl. Math."},{"key":"33_CR8","unstructured":"B\u00fcchi, J.R.: On a decision method in the restricted second-order arithmetic. In: Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley, pp. 1\u201311. Stanford University Press (1962)"},{"key":"33_CR9","first-page":"2","volume-title":"Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964","author":"J.R. B\u00fcchi","year":"1965","unstructured":"B\u00fcchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pp. 2\u201323. North Holland, Amsterdam (1965)"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y. Choueka","year":"1978","unstructured":"Choueka, Y.: Finite automata, definable sets, and regular expressions over \u03c9 n-tapes. J. Comput. System Sci.\u00a017(1), 81\u201397 (1978)","journal-title":"J. Comput. System Sci."},{"issue":"2-3","key":"33_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(84)90095-1","volume":"33","author":"D. Girault-Beauquier","year":"1984","unstructured":"Girault-Beauquier, D.: Bilimites de langages reconnaissables. Theoret. Comput. Sci.\u00a033(2-3), 335\u2013342 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR12","unstructured":"Hausdorff, F.: Set theory. In Chelsea, New York (1957)"},{"key":"33_CR13","first-page":"3","volume-title":"Automata studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E. (ed.) Automata studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Muller, D.: Infinite sequences and finite machines. In: Proc. of Fourth Annual IEEE Symp., editor, Switching Theory and Logical Design, pp. 3\u201316 (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Nivat, M., Perrin, D.: Ensembles reconnaissables de mots bi-infinis. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 47\u201359 (1982)","DOI":"10.1145\/800070.802176"},{"key":"33_CR16","unstructured":"Perrin, D., Pin, J.E.: Infinite words. In: Elsevier (ed.) Academic Press, London (2003)"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of formal languages","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Handbook of formal languages, vol.\u00a01, pp. 679\u2013746. Springer, Heidelberg (1997)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees\u00a0141, 1\u201335 (1969)","DOI":"10.2307\/1995086"},{"key":"33_CR19","first-page":"338","volume":"30","author":"F.D. Ramsey","year":"1929","unstructured":"Ramsey, F.D.: On a problem of formal logic. Proc. of the London math. soc.\u00a030, 338\u2013384 (1929)","journal-title":"Proc. of the London math. soc."},{"key":"33_CR20","volume-title":"Linear ordering","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear ordering. Academic Press, New York (1982)"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: 29th Annual Symposium on Foundations of computer sciences, pp. 24\u201329 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"issue":"3-4","key":"33_CR22","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8","author":"J. Wojciechowski","year":"1985","unstructured":"Wojciechowski, J.: Finite automata on transfinite sequences and regular expressions. Fundamenta informatic\u00e6\u00a08(3-4), 379\u2013396 (1985)","journal-title":"Fundamenta informatic\u00e6"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T02:55:58Z","timestamp":1637117758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}