{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:36:35Z","timestamp":1775054195310,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540642756","type":"print"},{"value":"9783540697152","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054310","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:37:37Z","timestamp":1149658657000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An Eilenberg theorem for words on countable ordinals"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"J. Almeida. Finite semigroups and universal algebra, volume 3 of Series in algebra. World Scientific, 1994.","DOI":"10.1142\/2481"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"A. Arnold. A syntactic congruence for rational \u03a9-languages. Theoretical Computer Science, 39:333\u2013335, 1985.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","unstructured":"N. Bedon. Automata, semigroups and recognizability of words on ordinals. IGM report 96-5, to appear in International Journal of Algebra and Computation."},{"key":"6_CR4","unstructured":"N. Bedon. Star-free sets of words on ordinals. IGM report 97-8, submitted to Information and Computation."},{"key":"6_CR5","unstructured":"J. R. B\u00fcchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1\u201311. Stanford University Press, 1962."},{"key":"6_CR6","first-page":"2","volume-title":"Transfinite automata recursions and weak second order theory of ordinals","author":"J. R. B\u00fcchi","year":"1965","unstructured":"J. R. B\u00fcchi. Transfinite automata recursions and weak second order theory of ordinals. In Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, pages 2\u201323. North-Holland, 1965."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","volume":"17","author":"Y. Choueka","year":"1978","unstructured":"Y. Choueka. Finite automata, definable sets, and regular expressions over \u03a9n-tapes. J. Comp. Syst. Sci., 17:81\u201397, 1978.","journal-title":"J. Comp. Syst. Sci."},{"key":"6_CR8","unstructured":"S. Eilenberg. Automata, languages and machines, volume B. Academic Press, 1976."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/3-540-16761-7_79","volume":"226","author":"J.-P. P\u00e9cuchet","year":"1986","unstructured":"J.-P. P\u00e9cuchet. Etude syntaxique des parties reconnaissables de mots infinis. Lecture Notes in Computer Science, 226:294\u2013303, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-16078-7_75","volume":"210","author":"J.-P. P\u00e9cuchet","year":"1986","unstructured":"J.-P. P\u00e9cuchet. Vari\u00e9t\u00e9s de semigroupes et mots infinis. Lecture Notes in Computer Science, 210:180\u2013191, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"6_CR11","first-page":"134","volume-title":"Mathematical foundations of computer science, volume 176 of Lecture Notes in Computer Science","author":"D. Perrin","year":"1984","unstructured":"D. Perrin. Recent results on automata and infinite words. In M. P. Chytil and V. Koubek, editors, Mathematical foundations of computer science, volume 176 of Lecture Notes in Computer Science, pages 134\u2013148, Berlin, 1984. Springer."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"D. Perrin and J.-E. Pin. Semigroups and automata on infinite words. In J. Fountain and V. A. R. Gould, editors, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pages 49\u201372. Kluwer academic publishers, 1995.","DOI":"10.1007\/978-94-011-0149-3_3"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"J.-E. Pin. Handbook of formal languages, volume 1, chapter Syntactic semigroups, pages 679\u2013746. Springer, 1997.","DOI":"10.1007\/978-3-642-59136-5_10"},{"key":"6_CR14","volume-title":"PhD thesis","author":"S. Rohde","year":"1997","unstructured":"S. Rohde. Alternating automata and the temporal logic of ordinals. PhD thesis, University of Illinois, Urbana-Champaign, 1997."},{"key":"6_CR15","volume-title":"Linear ordering","author":"J. G. Rosenstein","year":"1982","unstructured":"J. G. Rosenstein. Linear ordering. Academic Press, New York, 1982."},{"key":"6_CR16","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":"M. P. Sch\u00fctzenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190\u2013194, 1965.","journal-title":"Information and Control"},{"key":"6_CR17","unstructured":"D. Th\u00e9rien and T. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996. To appear."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"T. Wilke. An Eilenberg theorem for \u221e-languages. In Automata, Languages and Programming: Proc. of 18th ICALP Conference, pages 588\u2013599. Springer, 1991.","DOI":"10.1007\/3-540-54233-7_166"},{"issue":"3\u20134","key":"6_CR19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","volume":"8","author":"J. Wojciechowski","year":"1985","unstructured":"J. Wojciechowski. Finite automata on transfinite sequences and regular expressions. Fundamenta information, 8(3\u20134):379\u2013396, 1985.","journal-title":"Fundamenta information"}],"container-title":["Lecture Notes in Computer Science","LATIN'98: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T18:37:33Z","timestamp":1676054253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642756","9783540697152"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0054310","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}