Abstract
This paper investigates acceptance conditions for finite automata recognizing ω-regular languages. Their expressive power and their position w.r.t. the Borel hierarchy is also studied. The full characterization for the conditions (ninf, ⊓ ), (ninf, ⊆ ) and (ninf, = ) is given. The final section provides a partial characterization of (fin, = ).
This work has been partially supported by the French National Research Agency project EMC (ANR-09-BLAN-0164) and by PRIN/MIUR project “Mathematical aspects and forthcoming applications of automata and formal languages”.
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.
Similar content being viewed by others
References
Büchi, J.R.: Symposium on decision problems: On a decision method in restricted second order arithmetic. In: Suppes, P., Nagel, E., 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)
Hartmanis, J., Stearns, R.E.: Sets of numbers defined by finite automata. American Mathematical Monthly 74, 539–542 (1967)
Kupferman, O., Vardi, M.Y.: From Complementation to Certification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 591–606. Springer, Heidelberg (2004)
Kurshan, R.P.: Computer aided verification of coodinating process. Princeton Univ. Press (1994)
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. Theor. Comput. Sci. 174(1-2), 1–21 (1997)
Moriya, T., Yamasaki, H.: Accepting conditions for automata on ω-languages. Theor. Comput. Sci. 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 1963, pp. 3–16. IEEE Computer Society, Washington, DC (1963)
Perrin, D., Pin, J.-E.: Infinite words, automata, semigroups, logic and games. Pure and Applied Mathematics, vol. 141. Elsevier (2004)
Staiger, L., Wagner, K.W.: Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regulärer folgenmengen. Elektronische Informationsverarbeitung und Kybernetik 10(7), 379–392 (1974)
Staiger, L.: ω-languages. In: Handbook of Formal Languages, vol. 3, pp. 339–387 (1997)
Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 135–191. Elsevier (1990)
Vardi, M.Y.: The Büchi Complementation Saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 12–22. Springer, Heidelberg (2007)
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
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dennunzio, A., Formenti, E., Provillard, J. (2012). Acceptance Conditions for ω-Languages. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)