Determinization and Memoryless Winning Strategies

Information and Computation

Volumn 133, Issue 2, 1997, Pages 117-134

  Jutla, Charanjit S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346677098     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2624     Document Type: Article

References (20)

1. δσ, J. Symbolic Logic 48, 1171-1198.
2. Buchi, J. R., and Landweber, L. H. (1969), Solving sequential conditions by finite-state strategies, Trans. Am. Math. Soc. 138, 295-311.
3. Clarke, E. M., and Emerson, E. A. (1981), Design and synthesis of synchronization skeletons using branching time temporal logic, in "Proceedings IBM Workshop on Logics of Programs," Lecture Notes in Computer Science, No. 131, Springer-Verlag, Berlin/New York.
4. Emerson, E. A., and Halpern, J. Y. (1982), Decision procedures and expressiveness in the temporal logic of branching time, in "Proceedings, 14th ACM Symposium on Theory of Computation," pp. 169-180.
5. Emerson, E. A., and Jutla, C. S. (1988), Complexity of tree automata and modal logics of programs, in "Proceedings, 25th IEEE Symposium on Foundations of Computer Science."
6. Emerson, E. A., and Jutla, C. S. (1991), Mu-calculus, tree automata and determinacy, in "Proceedings, 28th IEEE Symposium on Foundations of Computer Science."
7. Emerson, E. A., and Sistla, A. P. (1984), Deciding branching time logic, Inform. and Control. 61, 175-201.
8. Gurevich, Y., and Harrington, L. (1982), Trees, automata, and games, in "Proceedings, 14th ACM Symposium on Theory of Computer Science."
9. Jutla, C. S. (1990), "Automata on Infinite Objects and Modal Logics of Programs," Ph.D. thesis, The University of Texas at Austin.
10. Klarlund, N. (1990), "Progress Measures and Finite Arguments for Infinite Computations," Ph.D. thesis, Cornell University.
11. Klarlund, N. (1992), Progress measures, immediate determinacy, and a subset construction for tree automata, in "Proceedings, 7th IEEE Symposium on Logics in Computer Science."
12. Martin, D. A. (1975), Borel determinacy, Ann. of Math. 102, 363-371.
13. McNaughton, R. (1966), Testing and generating infinite sequences by a finite automaton, Inform, and Control. 9, 521-530.
14. Mostowski, A. W. (1984), Regular expressions for infinite trees and a standard form of automata, in "Computation Theory" (A. Skowron, Ed.), Lecture Notes in Computer Science, Vol. 208, Springer-Verlag, Berlin/New York.
15. Muller, D. E., and Schupp, P. E. (1987), Alternating automata on infinite trees, Theoret. Comput. Sci. 54, 267-276.
16. Rabin, M. O. (1969), Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141, 1-35.
17. Safra, S. (1988), On complexity of ω-automata, in "Proceedings, 29th IEEE Symposium on Foundations of Computer Science."
18. Safra, S. (1989), "Complexity of Automata on Infinite Objects," Ph.D. thesis, Weizmann Institute of Science, Rehovot, Israel.
19. Safra, S. (1992), Exponential determinization for ω-automata with strong fairness acceptance condition, in "Proceedings, 24th ACM Symposium on Theory of Computer Science."
20. Street, R. S. (1981), "A Propositional Dynamic Logic of Looping and Converse," MIT LCS Technical Report TR-263.