There Exist Some ω-Powers of Any Borel Rank

DOI10.1007/978-3-540-74915-8_12zbMath1179.68069OpenAlexW1595846292MaRDI QIDQ3608408

Dominique Lecomte, Olivier Finkel

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_12

zbMATH Keywords

Borel setstopological complexityinfinite wordscomplete setsCantor topology\(\omega \)-languages\(\omega \)-powersBorel ranks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15)

Related Items (3)

Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank ⋮ Classical and effective descriptive complexities of \(\omega \)-powers ⋮ On some sets of dictionaries whose ω -powers have a given

This page was built for publication: There Exist Some ω-Powers of Any Borel Rank