On the complexity of parity word automata

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

Volumn 2030, Issue , 2001, Pages 276-286

  King, Valerie ^a   Kupferman, Orna ^b   Vardi, Moshe Y ^c  

^a UNIVERSITY OF VICTORIA   (Canada)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

ACCEPTANCE CONDITIONS; BEST-KNOWN ALGORITHMS; DYNAMIC GRAPH ALGORITHMS; INFINITE WORD; NONDETERMINISTIC AUTOMATA; SPECIAL STRUCTURE; WORD AUTOMATA;

AUTOMATA THEORY;

EID: 84945288929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_18     Document Type: Conference Paper

References (19)

1. R. Bloem, H.N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in n log n symbolic steps. In Formal Methods in Computer Aided Design, Lecture Notes in Computer Science. Springer-Verlag, 2000.
2. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press
3. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
4. Y. Choueka. Theories of automata on !-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
5. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 328-337, White Plains, October 1988
6. Vardi E.A. Emerson and C. Jutla. Tree automata, -calculus and determinacy. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 368-377, San Juan, October 1991.
7. M. Henzinger and J.A. Telle. Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning. In Proc. 5th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 10-20. Springer-Verlag, 1996.
8. M. Jurdzinski. Deciding the winner in parity games is in up\co-up. Information Processing Letters, 68(3):119-124, 1998.
9. D. Janin and I. Walukiewicz. Automata for the modal -calculus and related results. In Proc. 20th International Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages 552-562. Springer-Verlag, 1995.
10. D. Kozen. Results on the propositional -calculus. Theoretical Computer Science, 27:333-354, 1983.
11. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
12. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
13. A.W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Computation Theory, volume 208 of Lecture Notes in Computer Science, pages 157-168. Springer-Verlag, 1984.
14. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
15. H. Seidl and D. Niwinski. On distributive fixed-point expressions. Theoretical Informatics and Applications, 33(4-5):427-446, 1999.
16. R.E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.
17. R.E. Tarjan. A hierarchical clustering algorithm using strong components. Information Processing Letters, 14:26-29, 1982.
18. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
19. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.