{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T17:30:44Z","timestamp":1772386244690,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T00:00:00Z","timestamp":1593648000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00153-020-00737-4","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T22:02:24Z","timestamp":1593727344000},"page":"161-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Some complete $$\\omega $$-powers of a one-counter language, for any Borel class of finite rank"],"prefix":"10.1007","volume":"60","author":[{"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5410-767X","authenticated-orcid":false,"given":"Dominique","family":"Lecomte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,2]]},"reference":[{"key":"737_CR1","doi-asserted-by":"crossref","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1. Springer (1996)","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"737_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","volume":"15","author":"RS Cohen","year":"1977","unstructured":"Cohen, R.S., Gold, A.Y.: Theory of $$\\omega $$-languages, parts one and two. J. Comput. Syst. Sci. 15, 169\u2013208 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"737_CR3","unstructured":"Duparc, J., Finkel, O.: An $$\\omega $$-power of a context free language which is Borel above $${\\Delta }_\\omega ^0$$. In: Proceedings of the International Conference Foundations of the Formal Sciences V: Infinite Games, November 26th to 29th, 2004, Bonn, Germany, volume\u00a011 of College Publications at King\u2019s College (Studies in Logic), pp. 109\u2013122. London (2007)"},{"issue":"1","key":"737_CR4","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. J. Symb. Log. 66(1), 56\u201386 (2001)","journal-title":"J. Symb. Log."},{"issue":"1\u20132","key":"737_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. Theor. Comput. Sci. 262(1\u20132), 669\u2013697 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"737_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. Theor. Comput. Sci. 290(3), 1385\u20131405 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3\u20134","key":"737_CR7","first-page":"333","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. Fundam. Inf. 62(3\u20134), 333\u2013342 (2004)","journal-title":"Fundam. Inf."},{"issue":"5","key":"737_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. Math. Struct. Comput. Sci. 16(5), 813\u2013840 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"737_CR9","unstructured":"Finkel, O., Lecomte, D.: There exist some $$\\omega $$-powers of any Borel rank. In: Proceedings of the 16th EACSL Annual International Conference on Computer Science and Logic, CSL 2007, Lausanne, Switzerland, September 11\u201315, 2007, volume 4646 of Lecture Notes in Computer Science, pp. 115\u2013129. Springer (2007)"},{"issue":"2","key":"737_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.apal.2009.02.005","volume":"160","author":"O Finkel","year":"2009","unstructured":"Finkel, O., Lecomte, D.: Classical and effective descriptive complexities of omega-powers. Ann. Pure Appl. Log. 160(2), 163\u2013191 (2009). arXiv:0708.4176","journal-title":"Ann. Pure Appl. Log."},{"key":"737_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Co., Reading (2001). (Addison-Wesley Series in Computer Science)"},{"key":"737_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"AS Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995)"},{"issue":"4","key":"737_CR13","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. J. Symb. Log. 70(4), 1210\u20131232 (2005)","journal-title":"J. Symb. Log."},{"key":"737_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":"737_CR15","unstructured":"Niwinski, D.: A problem on $$\\omega $$-powers. In: 1990 Workshop on Logics and Recognizable Sets. University of Kiel (1990)"},{"key":"737_CR16","volume-title":"Infinite Words, Automata, Semigroups, Logic and Games, volume 141 of Pure and Applied Mathematics","author":"D Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words, Automata, Semigroups, Logic and Games, volume 141 of Pure and Applied Mathematics. Elsevier, Amsterdam (2004)"},{"key":"737_CR17","unstructured":"Simonnet, P.: Automates et th\u00e9orie descriptive. Ph.D. thesis, Universit\u00e9 Paris VII (1992)"},{"issue":"5\u20136","key":"737_CR18","first-page":"219","volume":"22","author":"L Staiger","year":"1986","unstructured":"Staiger, L.: Hierarchies of recursive $$\\omega $$-languages. Elektronische Informationsverarbeitung und Kybernetik 22(5\u20136), 219\u2013241 (1986)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"737_CR19","doi-asserted-by":"crossref","unstructured":"Staiger, L.: $$\\omega $$-languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 339\u2013387. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59126-6_6"},{"key":"737_CR20","first-page":"135","volume-title":"Handbook of Theoretical Computer Science, volume B, Formal Models and Semantics","author":"W Thomas","year":"1990","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, Amsterdam (1990)"},{"key":"737_CR21","unstructured":"Wadge, W.: Reducibility and determinateness in the Baire space. Ph.D. thesis, University of California, Berkeley (1983)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-020-00737-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-020-00737-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-020-00737-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T23:39:09Z","timestamp":1625182749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-020-00737-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,2]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["737"],"URL":"https:\/\/doi.org\/10.1007\/s00153-020-00737-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,2]]},"assertion":[{"value":"31 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}