{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:10:28Z","timestamp":1737393028752,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_12","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"115-129","source":"Crossref","is-referenced-by-count":2,"title":["There Exist Some \u03c9-Powers of Any Borel Rank"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Lecomte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0036895","volume-title":"Automata, Languages and Programming","author":"A. Arnold","year":"1983","unstructured":"Arnold, A.: Topological Characterizations of Infinite Behaviours of Transition Systems, Automata, Languages and Programming, J. In: D\u00edaz, J. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0154, pp. 28\u201338. Springer, Heidelberg (1983)"},{"key":"12_CR2","volume-title":"Handbook of Formal Languages","author":"J.-M. Autebert","year":"1996","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context Free Languages and Pushdown Automata. In: Handbook of Formal Languages, vol.\u00a01, Springer, Heidelberg (1996)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2694911","volume":"66","author":"J. Duparc","year":"2001","unstructured":"Duparc, J.: Wadge Hierarchy and Veblen Hierarchy: Part 1: Borel Sets of Finite Rank. Journal of Symbolic Logic\u00a066(1), 56\u201386 (2001)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR4","unstructured":"Duparc, J., Finkel, O.: An \u03c9-Power of a Context-Free Language Which Is Borel Above \u0394 0 \u03c9 . In: submitted to the Proceedings of the International Conference Foundations of the Formal Sciences V: Infinite Games, Bonn, Germany (November 26-29, 2004)"},{"issue":"1-2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0304-3975(00)00405-9","volume":"262","author":"O. Finkel","year":"2001","unstructured":"Finkel, O.: Topological Properties of Omega Context Free Languages. Theoretical Computer Science\u00a0262(1-2), 669\u2013697 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"12_CR6","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\u00a0290(3), 1385\u20131405 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3-4","key":"12_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FUN-2004-623-403","volume":"62","author":"O. Finkel","year":"2004","unstructured":"Finkel, O.: An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank. Fundamenta Informaticae\u00a062(3-4), 333\u2013342 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"12_CR8","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\u00a016(5), 813\u2013840 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR9","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley Publishing Company, Reading, Massachussetts (1969)"},{"key":"12_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"A.S. Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"915","DOI":"10.2307\/2274751","volume":"54","author":"A.S. Kechris","year":"1989","unstructured":"Kechris, A.S., Marker, D., Sami, R.L.: \u03a0 1 1 Borel Sets. The Journal of Symbolic Logic\u00a054(3), 915\u2013920 (1989)","journal-title":"The Journal of Symbolic Logic"},{"key":"12_CR12","volume-title":"Topology","author":"K. Kuratowski","year":"1966","unstructured":"Kuratowski, K.: Topology, vol.\u00a01. Academic Press, New York (1966)"},{"key":"12_CR13","unstructured":"Lecomte, D.: Sur les Ensembles de Phrases Infinies Constructibles a Partir d\u2019un Dictionnaire sur un Alphabet Fini, S\u00e9minaire d\u2019Initiation a l\u2019Analyse, vol. 1, ann\u00e9e (2001-2002)"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.2178\/jsl\/1129642123","volume":"70","author":"D. Lecomte","year":"2005","unstructured":"Lecomte, D.: Omega-Powers and Descriptive Set Theory. Journal of Symbolic Logic\u00a070(4), 1210\u20131232 (2005)","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","first-page":"583","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, W.-P., Rozenberg, G. (eds.) A Decade of Concurrency. LNCS, vol.\u00a0803, pp. 583\u2013621. Springer, Heidelberg (1994)"},{"key":"12_CR16","volume-title":"Descriptive Set Theory","author":"Y.N. Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. North-Holland, Amsterdam (1980)"},{"key":"12_CR17","unstructured":"Niwinski, D.: Problem on \u03c9-Powers posed in the Proceedings of the 1990 Workshop Logics and Recognizable Sets (Univ. Kiel)"},{"key":"12_CR18","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words, Automata, Semigroups, Logic and Games. Pure and Applied Mathematics\u00a0141 (2004)"},{"key":"12_CR19","unstructured":"Simonnet, P.: Automates et Th\u00e9orie Descriptive, Ph. D. Thesis, Universit\u00e9 Paris 7 (March 1992)"},{"key":"12_CR20","first-page":"219","volume":"5\/6","author":"L. Staiger","year":"1986","unstructured":"Staiger, L.: Hierarchies of Recursive \u03c9-Languages. Jour. Inform. Process. Cybernetics EIK 22\u00a05\/6, 219\u2013241 (1986)","journal-title":"Jour. Inform. Process. Cybernetics EIK 22"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Staiger, L.: \u03c9-Languages, Chapter of the Handbook of Formal Languages. In: Rozenberg, G., Salomaa, A. (eds.), vol.\u00a03, Springer, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59126-6_6"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-62844-4_27","volume-title":"New Trends in Formal Languages","author":"L. Staiger","year":"1997","unstructured":"Staiger, L.: On \u03c9-Power Languages, in New Trends in Formal Languages, Control, Coperation, and Combinatorics. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol.\u00a01218, pp. 377\u2013393. Springer, Heidelberg (1997)"},{"key":"12_CR23","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T16:44:12Z","timestamp":1737391452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}