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 \({\textsf{F}}^R_{\sigma}\) and \({\textsf{G}}^R_{\delta}\). 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.
This work has been partially supported by the French National Research Agency project EMC (ANR-09-BLAN-0164.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Büchi, J.R.: Symposium on decision problems: On a decision method in restricted second order arithmetic. In: Ernest Nagel, P.S., Tarski, A. (eds.) Logic, Methodology and Philosophy of Science Proceeding of the 1960 International Congress. Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1–11. Elsevier (1960)
Cervelle, J., Dennunzio, A., Formenti, E., Provillard, J.: Acceptance conditions for ω-languages and the Borel hierarchy (2013) (submitted)
Dennunzio, A., Formenti, E., Provillard, J.: Acceptance conditions for ω-languages. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 320–331. Springer, Heidelberg (2012)
Hartmanis, J., Stearns, R.E.: Sets of numbers defined by finite automata. American Mathematical Monthly 74, 539–542 (1967)
Landweber, L.H.: Decision problems for omega-automata. Mathematical Systems Theory 3(4), 376–384 (1969)
Litovsky, I., Staiger, L.: Finite acceptance of infinite words. Theoretical Computer Science 174(1-2), 1–21 (1997)
Moriya, T., Yamasaki, H.: Accepting conditions for automata on ω-languages. Theoretical Computer Science 61, 137–147 (1988)
Muller, D.E.: Infinite sequences and finite machines. In: Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design, SWCT 19, pp. 3–16. IEEE Computer Society (1963)
Perrin, D., Pin, J.E.: Infinite words, automata, semigroups, logic and games. In: Pure and Applied Mathematics, vol. 141. Elsevier (2004)
Staiger, L.: ω-languages. In: Handbook of formal languages, vol. 3, pp. 339–387. Springer (1997)
Staiger, L., Wagner, K.W.: Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regulärer folgenmengen. Elektronische Informationsverarbeitung und Kybernetik 10(7), 379–392 (1974)
Wagner, K.W.: On ω-regular sets. Information and Control 43(2), 123–177 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Formenti, E., Holzer, M., Kutrib, M., Provillard, J. (2014). ω-rational Languages: High Complexity Classes vs. Borel Hierarchy. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-04921-2_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04920-5
Online ISBN: 978-3-319-04921-2
eBook Packages: Computer ScienceComputer Science (R0)