{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:16Z","timestamp":1779448276671,"version":"3.53.1"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T00:00:00Z","timestamp":1772409600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115838","type":"journal-article","created":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T06:50:05Z","timestamp":1772347805000},"page":"115838","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Some regular \u03c9-powers in the Hausdorff-Kuratowski hierarchy"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6461-2941","authenticated-orcid":false,"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan","family":"Girardot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5410-767X","authenticated-orcid":false,"given":"Dominique","family":"Lecomte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115838_bib0001","series-title":"Handbook of Theoretical Computer Science","first-page":"135","article-title":"Automata on infinite objects","volume":"B, Formal models and semantics","author":"Thomas","year":"1990"},{"key":"10.1016\/j.tcs.2026.115838_bib0002","series-title":"Handbook of Formal Languages","first-page":"339","article-title":"\u03c9-languages","volume":"3","author":"Staiger","year":"1997"},{"key":"10.1016\/j.tcs.2026.115838_bib0003","article-title":"Infinite words, automata, semigroups, logic and games","volume":"141","author":"Perrin","year":"2004"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115838_bib0004","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/S0304-3975(00)00405-9","article-title":"Topological properties of \u03c9-context free languages","volume":"262","author":"Finkel","year":"2001","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115838_bib0005","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/S0304-3975(02)00042-7","article-title":"Borel hierarchy and \u03c9-context free languages","volume":"290","author":"Finkel","year":"2003","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115838_bib0006","series-title":"Proceedings of the 16th EACSL Annual International Conference on Computer Science and Logic, CSL 2007, Lausanne, Switzerland, September 11\u201315, 2007","first-page":"115","article-title":"There exist some \u03c9-powers of any Borel rank","volume":"4646","author":"Finkel","year":"2007"},{"issue":"4","key":"10.1016\/j.tcs.2026.115838_bib0007","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.2178\/jsl\/1129642123","article-title":"\u03c9-powers and descriptive set theory","volume":"70","author":"Lecomte","year":"2005","journal-title":"J. Symbol. Log."},{"issue":"2","key":"10.1016\/j.tcs.2026.115838_bib0008","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.apal.2009.02.005","article-title":"Classical and effective descriptive complexities of \u03c9-Powers","volume":"160","author":"Finkel","year":"2009","journal-title":"Ann. Pure Appl. Log."},{"key":"10.1016\/j.tcs.2026.115838_bib0009","series-title":"Contemporary Logic and Computing","first-page":"518","article-title":"Descriptive set theory and \u03c9-powers of finitary languages","volume":"1","author":"Finkel","year":"2020"},{"key":"10.1016\/j.tcs.2026.115838_bib0010","series-title":"1990 Workshop on Logics and Recognizable Sets","article-title":"A problem on \u03c9-powers","author":"Niwi\u0144ski","year":"1990"},{"key":"10.1016\/j.tcs.2026.115838_bib0011","series-title":"Automates et th\u00e9orie descriptive","author":"Simonnet","year":"1992"},{"issue":"3\u20134","key":"10.1016\/j.tcs.2026.115838_bib0012","doi-asserted-by":"crossref","first-page":"333","DOI":"10.3233\/FUN-2004-623-403","article-title":"An \u03c9-power of a finitary language which is a Borel set of infinite rank","volume":"62","author":"Finkel","year":"2004","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.tcs.2026.115838_bib0013","series-title":"Proceedings of the International Conference Foundations of the Formal Sciences V : Infinite Games, November 26th to 29th, 2004, Bonn, Germany","first-page":"109","article-title":"An \u03c9-power of a context free language which is Borel above \u0394\u03c90","volume":"11","author":"Duparc","year":"2007"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115838_bib0014","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00153-020-00737-4","article-title":"Some complete \u03c9-powers of a one-counter language, for any Borel class of finite rank","volume":"60","author":"Finkel","year":"2021","journal-title":"Arch. Math. Log."},{"key":"10.1016\/j.tcs.2026.115838_bib0015","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(87)90063-6","article-title":"On generators of rational \u03c9-Power languages","volume":"53","author":"Litovsky","year":"1987","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115838_bib0016","series-title":"Reducibility and determinateness in the Baire space","author":"Wadge","year":"1983"},{"issue":"2","key":"10.1016\/j.tcs.2026.115838_bib0017","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","article-title":"On \u03c9-regular sets","volume":"43","author":"Wagner","year":"1979","journal-title":"Inform. Control"},{"key":"10.1016\/j.tcs.2026.115838_bib0018","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0304-3975(97)00301-0","article-title":"Fine hierarchy of regular \u03c9-Languages","volume":"191","author":"Selivanov","year":"1998","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115838_bib0019","series-title":"Special Issue on Intensional Programming and Semantics in honour of Bill Wadge on the occasion of his 60th cycle, Mathematics in Computer Science","first-page":"5","article-title":"Wadge reducibility and infinite computations","volume":"2","author":"Selivanov","year":"2008"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115838_bib0020","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tcs.2008.06.031","article-title":"Fine hierarchies and m-reducibilities in theoretical computer science","volume":"405","author":"Selivanov","year":"2008","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115838_bib0021","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(92)90342-D","article-title":"The Hausdorff-Kuratowski hierarchy of \u03c9-regular languages and a hierarchy of Muller automata","volume":"96","author":"Barua","year":"1992","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115838_bib0022","series-title":"New Trends in Formal Languages, Control, Coperation, and Combinatorics","first-page":"377","article-title":"On \u03c9-power languages","volume":"1218","author":"Staiger","year":"1997"},{"issue":"3","key":"10.1016\/j.tcs.2026.115838_bib0023","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1002\/malq.202400024","article-title":"Wadge degrees of \u039420\u03c9-powers","volume":"70","author":"Finkel","year":"2024","journal-title":"Math. Log. Q."},{"key":"10.1016\/j.tcs.2026.115838_bib0024","series-title":"Classical descriptive set theory","author":"Kechris","year":"1995"},{"issue":"4","key":"10.1016\/j.tcs.2026.115838_bib0025","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. Syst. Theory"},{"issue":"1","key":"10.1016\/j.tcs.2026.115838_bib0026","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2694911","article-title":"Wadge hierarchy and Veblen hierarchy: part 1: Borel sets of finite rank","volume":"66","author":"Duparc","year":"2001","journal-title":"J. Symbol. Log."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000976?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000976?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:45Z","timestamp":1779447765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000976"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":26,"alternative-id":["S0304397526000976"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115838","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Some regular \u03c9-powers in the Hausdorff-Kuratowski hierarchy","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115838","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115838"}}