{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:15Z","timestamp":1725558975711},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_32","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:06:05Z","timestamp":1278083165000},"page":"381-392","source":"Crossref","is-referenced-by-count":4,"title":["Complementation of Rational Sets on Countable Scattered Linear Orderings"],"prefix":"10.1007","author":[{"given":"Chlo\u00e9","family":"Rispal","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","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":"32_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/inco.2000.3009","volume":"166","author":"N. Bedon","year":"2001","unstructured":"Bedon, N.: Star-free sets of words on ordinals. Inform. Comput.\u00a0166, 93\u2013111 (2001)","journal-title":"Inform. Comput."},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0054310","volume-title":"LATIN 1998: 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":"32_CR4","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":"32_CR5","unstructured":"Bruy\u00e8re, V., Carton, O., S\u00e9nizergues, G.: Tree automata and automata on linear orderings. In: Harju, T., Karhum\u00e4ki, J. (eds.) WORDS 2003. Turku Center for Computer Science, vol.\u00a027, pp. 222\u2013231 (2003)"},{"key":"32_CR6","doi-asserted-by":"publisher","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":"32_CR7","first-page":"1","volume-title":"Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960","author":"J.R. B\u00fcchi","year":"1962","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 1960, pp. 1\u201311. Stanford University Press, Stanford (1962)"},{"key":"32_CR8","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, North Holland, pp. 2\u201323 (1965)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24698-5_33","volume-title":"LATIN 2004: Theoretical Informatics","author":"O. Carton","year":"2004","unstructured":"Carton, O., Rispal, C.: Complementation of rational sets on scattered linear orderings of finite rank. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 292\u2013301. Springer, Heidelberg (2004)"},{"issue":"2\u20133","key":"32_CR10","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\u20133), 335\u2013342 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR11","unstructured":"Hausdorff, F.: Set theory. In: Chelsea, New York (1957)"},{"key":"32_CR12","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":"32_CR13","first-page":"521","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Comput.\u00a09, 521\u2013530 (1966)","journal-title":"Inform. Comput."},{"key":"32_CR14","volume-title":"Counter free automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter free automata. MIT Press, Cambridge (1971)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Muller, D.: Infinite sequences and finite machines. In: Proc. of\u00a0Fourth Annual IEEE\u00a0Symp., editor, Switching Theory and Logical Design, pp. 3\u201316 (1963)","DOI":"10.1109\/SWCT.1963.8"},{"key":"32_CR16","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":"32_CR17","doi-asserted-by":"crossref","unstructured":"P\u00e9cuchet, J.-P.: Etude syntaxique des parties reconnaissables de mots infinis, vol.\u00a0226, pp. 294\u2013303 (1986)","DOI":"10.1007\/3-540-16761-7_79"},{"key":"32_CR18","volume-title":"Elsevier, editor","author":"D. Perrin","year":"2003","unstructured":"Perrin, D., Pin, J.-E.: Infinite words. In: Elsevier, editor, Academic Press, London (2003)"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees, vol.\u00a0141, pp. 1\u201335 (1969)","DOI":"10.2307\/1995086"},{"key":"32_CR20","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":"32_CR21","volume-title":"Linear ordering","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear ordering. Academic Press, New York (1982)"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.-P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.-P.: On finite monoids having only trivial subgroups. Inform. Control\u00a08, 190\u2013194 (1965)","journal-title":"Inform. Control"}],"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-540-30550-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:17Z","timestamp":1605741677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}