{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:55Z","timestamp":1759637995520},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0304-3975(95)00006-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"119-144","source":"Crossref","is-referenced-by-count":26,"title":["Finite automata and ordinals"],"prefix":"10.1016","volume":"156","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00006-2_BIB1","series-title":"Logic, Methodology and Philosophy of Science: Proc. Internat. Congr.","first-page":"1","article-title":"On a decision method in the restricted second-order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(95)00006-2_BIB2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1090\/S0002-9904-1965-11384-2","article-title":"Decision methods in the theory of ordinals","volume":"71","author":"B\u00fcchi","year":"1965","journal-title":"Bull Am. Math. Soc."},{"key":"10.1016\/0304-3975(95)00006-2_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","article-title":"Theories of automata on \u03c9-tapes: a simplified approach","volume":"8","author":"Choueka","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00006-2_BIB4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0022-0000(78)90036-3","article-title":"Finite automata, definable sets, and regular expressions over \u03c9n-tapes","volume":"17","author":"Choueka","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00006-2_BIB5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00006-2_BIB6","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00006-2_BIB7","series-title":"Switching Circuit Theory and Logical Design: Proc. Fourth Ann. Symp.","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963"},{"key":"10.1016\/0304-3975(95)00006-2_BIB8","unstructured":"D. Perrin and J.E. Pin, Mots infinis, LITP Report Paris 93-40, to appear."},{"key":"10.1016\/0304-3975(95)00006-2_BIB9","series-title":"Linear Ordering","author":"Rosenstein","year":"1982"},{"key":"10.1016\/0304-3975(95)00006-2_BIB10","series-title":"Le\u00e7ons sur les nombres transfinis","author":"Sierpi\u0144ski","year":"1950"},{"key":"10.1016\/0304-3975(95)00006-2_BIB11","series-title":"Cardinal and Ordinal Numbers","author":"Sierpi\u0144ski","year":"1965"},{"key":"10.1016\/0304-3975(95)00006-2_BIB12","first-page":"135","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/0304-3975(95)00006-2_BIB13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/FI-1984-7203","article-title":"Classes of transfinite sequences accepted by finite automata","volume":"7.2","author":"Wojciechowski","year":"1984","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/0304-3975(95)00006-2_BIB14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3233\/FI-1985-83-407","article-title":"Finite automata on transfinite sequences and regular expressions","volume":"8.3\u20138.4","author":"Wojcieahowski","year":"1985","journal-title":"Fundamenta informaticae"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T20:31:11Z","timestamp":1680985871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0304397595000062"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00006-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}