{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:02:31Z","timestamp":1742965351242,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_18","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1016\/S0304-3975(02)00042-7","volume":"290","author":"O Finkel","year":"2003","unstructured":"Finkel, O.: Borel hierarchy and omega context free languages. Theoretical Computer Science 290(3), 1385\u20131405 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1017\/S0960129506005597","volume":"16","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: Borel ranks and Wadge degrees of omega context free languages. Mathematical Structures in Computer Science 16(5), 813\u2013840 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/11672142_24","volume-title":"STACS 2006","author":"O Finkel","year":"2006","unstructured":"Finkel, O.: On the accepting power of 2-tape b\u00fcchi automata. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 301\u2013312. Springer, Heidelberg (2006)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Finkel, O.: The complexity of infinite computations in models of set theory. Logical Methods in Computer Science 5(4:4), 1\u201319 (2009)","DOI":"10.2168\/LMCS-5(4:4)2009"},{"key":"18_CR5","unstructured":"Finkel, O.: Decision problems for recognizable languages of infinite pictures. In: Studies in Weak Arithmetics, Proceedings of the International Conference 28th Weak Arithmetic Days, June 17\u201319, vol. 196. Publications of the Center for the Study of Language and Information. Lecture Notes, pages 127\u2013151. Stanford University (2010)"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1051\/ita\/2011113","volume":"45","author":"O Finkel","year":"2011","unstructured":"Finkel, O.: Some problems in automata theory which depend on the models of set theory. RAIRO - Theoretical Informatics and Applications 45(4), 383\u2013397 (2011)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Finkel, O.: Ambiguity of \n$$\\omega $$\n-languages of Turing machines. Logical Methods in Computer Science 10(3:12), 1\u201318 (2014)","DOI":"10.2168\/LMCS-10(3:12)2014"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gire, F., Nivat, M.: Relations rationnelles infinitaires. Calcolo, pp. 91\u2013125 (1984)","DOI":"10.1007\/BF02575909"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, W. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research, vol. 2500. LNCS. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-36387-4"},{"key":"18_CR10","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Co., Reading (2001)"},{"key":"18_CR11","unstructured":"Jech, T.: Set theory, 3rd edn., Springer (2002)"},{"key":"18_CR12","unstructured":"Kunen, K.: Set theory. Studies in Logic and the Foundations of Mathematics, vol. 102. An introduction to independence proofs. North-Holland Publishing Co., Amsterdam (1980)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-58043-3_29","volume-title":"A Decade of Concurrency","author":"H Lescow","year":"1994","unstructured":"Lescow, H., Thomas, W.: Logical specifications of infinite computations. In: de Bakker, J.W., de Roever, Willem-Paul, Rozenberg, Grzegorz (eds.) REX 1993. LNCS, vol. 803, pp. 583\u2013621. Springer, Heidelberg (1994)"},{"key":"18_CR14","volume-title":"Descriptive set theory","author":"YN Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive set theory. North-Holland Publishing Co., Amsterdam (1980)"},{"key":"18_CR15","unstructured":"Perrin, D., Pin, J.-E.: Infinite words, automata, semigroups, logic and games. Pure and Applied Mathematics, vol. 141. Elsevier (2004)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Staiger, L.: \n$$\\omega $$\n-languages. In: Handbook of Formal Languages, vol. 3, pp. 339\u2013387. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59126-6_6"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp. 135\u2013191. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:07:42Z","timestamp":1676945262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}