{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:16Z","timestamp":1725488596947},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_25","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"252-263","source":"Crossref","is-referenced-by-count":0,"title":["How Powerful Are Infinite Time Machines?"],"prefix":"10.1007","author":[{"given":"Gr\u00e9gory","family":"Lafitte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(95)00006-2","volume":"156","author":"N. Bedon","year":"1996","unstructured":"N. Bedon, Finite automata and ordinals, Theoretical Computer Science 156 (1996), 119\u2013144.","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196798000028","volume":"8","author":"N. Bedon","year":"1998","unstructured":"-, Automata, semigroups and recognizability of words on ordinals, International Journal of Algebra and Computation 8 (1998), 1\u201321.","journal-title":"International Journal of Algebra and Computation"},{"key":"25_CR3","unstructured":"-, Langages reconnaissables de mots index\u00e9s par des ordinaux, Ph.D. thesis, Universit\u00e9 de Marne-la-Vall\u00e9e, 1998."},{"key":"25_CR4","unstructured":"N. Bedon and O. Carton, An Eilenberg theorem for words on countable ordinals, Latin\u201998: Theoretical Informatics (Cl\u00e1udio L. Lucchesi and Arnaldo V. Moura, eds.), Lect. Notes in Comput. Sci., vol. 1380, Springer-Verlag, 1998, pp. 53\u201364."},{"key":"25_CR5","unstructured":"J. R. B\u00fcchi, On a decision method in the restricted second-order arithmetic, Logic, Methodology, and Philosophy of Science: Proc. 1960 Intern. Congr., Stanford University Press, 1962, pp. 1\u201311."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1090\/S0002-9904-1965-11384-2","volume":"71","author":"J. R. B\u00fcchi","year":"1965","unstructured":"-, Decision methods in the theory of ordinals, Bulletin of the American Mathematical Society 71 (1965), 767\u2013770.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"25_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 \u03c9\n                           \n                    n\n                  -tapes, Journal of Computer and System Sciences 17 (1978), 81\u201397.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J. D. Hamkins","year":"2000","unstructured":"J. D. Hamkins and A. Lewis, Infinite time Turing machines, Journal of Symbolic Logic 65 (2000), no. 2, 567\u2013604.","journal-title":"Journal of Symbolic Logic"},{"key":"25_CR9","unstructured":"G. Lafitte, How powerful are infinite time machine?, RR 2001-16, LIP, Ecole Normale Sup\u00e9rieure de Lyon, March 2001, \n                    ftp:\/\/ftp.ens-lyon.fr\/pub\/LIP\/Rapports\/RR\/RR2001\/\n                    \n                  ."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9 (1966), 521\u2013530.","journal-title":"Information and Control"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SWCT.1963.8","volume-title":"Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design","author":"D. E. M\u00fcller","year":"1963","unstructured":"D. E. M\u00fcller, Infinite sequences and finite machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (Chicago, Illinois), IEEE, October 1963, pp. 3\u201316."},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0030294","volume-title":"Mathematical foundations of computer science (Berlin)","author":"D. Perrin","year":"1984","unstructured":"D. Perrin, Recent results on automata and infinite words, Mathematical foundations of computer science (Berlin) (M. P. Chytil and V. Koubek, eds.), Lecture Notes in Computer Science, vol. 176, Springer-Verlag, 1984, pp. 134\u2013148."},{"key":"25_CR13","unstructured":"D. Perrin and J.-E. Pin, Mots infinis, to appear, 1997."},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1112\/S0024609399006657","volume":"32","author":"P. Welch","year":"2000","unstructured":"P. Welch, The length of infinite time Turing machine computations, Bulletin of the London Mathematical Society 32 (2000), no. 2, 129\u2013136.","journal-title":"Bulletin of the London Mathematical Society"},{"issue":"2","key":"25_CR15","first-page":"191","volume":"VII","author":"J. Wojciechowski","year":"1984","unstructured":"J. Wojciechowski, Classes of transfinite sequences accepted by finite automata, Annales Societatis Mathematic\u00e6 Polon\u00e6, Fundamenta Informatic\u00e6 VII (1984), no. 2, 191\u2013223.","journal-title":"Annales Societatis Mathematic\u00e6 Polon\u00e6, Fundamenta Informatic\u00e6"},{"issue":"3\u20134","key":"25_CR16","first-page":"379","volume":"VIII","author":"J. Wojciechowski","year":"1985","unstructured":"-, Finite automata on transfinite sequences and regular expressions, Annales Societatis Mathematic\u00e6 Polon\u00e6, Fundamenta Informatic\u00e6 VIII (1985), no. 3\u20134, 379\u2013396.","journal-title":"Annales Societatis Mathematic\u00e6 Polon\u00e6, Fundamenta Informatic\u00e6"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:22:53Z","timestamp":1550740973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}