Abstract
The paper investigates classes of languages of infinite words with respect to the acceptance conditions of the finite automata recognizing them. Some new natural classes are compared with the Borel hierachy. In particular, it is proved that (fin, =) is as high as and FσR and GδR. As a side effect, it is also proved that in this last case, considering or not considering the initial state of the FA makes a substantial difference. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Formenti, E., Holzer, M., Kutrib, M., & Provillard, J. (2014). ω-rational languages: High complexity classes vs. Borel hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 372–383). https://doi.org/10.1007/978-3-319-04921-2_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
