ω-rational Languages: High Complexity Classes vs. Borel Hierarchy

DOI10.1007/978-3-319-04921-2_30zbMath1407.68253OpenAlexW2104991609MaRDI QIDQ5404928

Martin Kutrib, Julien Provillard, Markus Holzer, Enrico Formenti

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_30

zbMATH Keywords

Borel hierarchyacceptance conditions\(\omega \)-rational languages

Mathematics Subject Classification ID

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

This page was built for publication: ω-rational Languages: High Complexity Classes vs. Borel Hierarchy