Optimal bounds for transformations of ω-automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1738, Issue , 1999, Pages 97-109

  Löding, Christof ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

ACCEPTANCE CONDITIONS; DETERMINISTIC AUTOMATA; HEIDELBERG; OPTIMAL BOUNDS;

AUTOMATA THEORY;

EID: 84958751885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_8     Document Type: Conference Paper

References (18)

1. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method and Philos. Sci. 1960, pages 1-11, 1962.
2. σ games. manuscript, 1981.
3. δσ. Journal of Symbolic Logic, 48(4):1171-1198, December 1983.
4. S. Dziembowski, M. Jurdzński, and I. Walükiewicz. How much memory is needed to win infinite games? In Proc. IEEE, LICS, 1997.
5. Y. Gurevich and L. Harrington. Trees, automata and games. In Proc. 14th ACM Symp. on the Theory of Computing, pages 60-65, 1982.
6. S. Krishnan, A. Puri, and R. Brayton. Structural complexity of ω-automata. In 12th Annual Symposium on Theoretical Aspects of Computer Science, volume 900 of Lecture Notes in Computer Science, pages 143-156. Springer, 1995.
7. L.H. Landweber. Decision problems for ω-automata. Math. System Theory, 3:376-384, 1969.
8. C. Löding. Methods for the transformation of ω-automata: Complexity and connection to second order logic. Master’s thesis, Christian-Albrechts-University of Kiel, 1998.
9. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
10. M. Michel. Complementation is much more difficult with automata on infinite words. Manuscript, CNET, Paris, 1988.
11. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. Lecture Notes in Computer Science, 208:157-168, 1984.
12. D.E. Muller. Infinite sequences and finite machines. In Proc. 4th IEEE Symposium on Switching Circuit Theory and Logical design, pages 3-16, 1963.
13. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
14. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, 1988.
15. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symp. on the Theory of Computing, pages 275-282, 1992.
16. S. Safra and M. Y. Vardi. On ω-automata and temporal logic. In Proc. 21th ACM Symp. on the Theory of Computing, 1989.
17. R.S. Streett. Propositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121-141, 1982.
18. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 385-455. Springer-Verlag, 1997.