Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science

Volumn 200, Issue 1-2, 1998, Pages 135-183

  Zielonka, Wiesław ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Infinite games; Infinite trees; Rabin complementation lemma

Indexed keywords

EID: 0000647754     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00009-7     Document Type: Review

References (32)

1. A. Arnold, An initial semantics of the μ-calculus on trees and Rabin's complementation theorem, Theoret. Comput. Sci. 148 (1994) 121-132.
2. E. Börger, E. Grädel, Y. Gurevich, The Classical Decision Problems, Springer, Verlag, Berlin, 1997.
3. J.R. Büchi, Using determinacy to eliminate quantifiers, in; Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol. 56, Springer, Berlin, 1997, pp. 367-378.
4. δσ, J. Symbol. Logic 48 (1983) 1171-1198.
5. M. Davis, Infinite games of perfect information, in: Advances in Game Theory, Annals of Mathematical Studies, vol. 52, Princeton University Press, Princeton, NJ, 1964, pp. 85-101.
6. V. Diekert, Personal communication, March 1996.
7. S. Dziembowski, M. Jurdziński, I. Walukiewicz, How much memory is needed to win infinite games? in: 12th Annual Symp. on Logic in Computer Science, Warsaw, 1997.
8. A.E. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 328-337.
9. A.E. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy, in: Proc. 32th IEEE Symp. on Foundations of Computer Science, 1991, pp. 368-377.
10. Y. Gurevich, Games people play, in: S. MacLane, D. Siefkes (Eds.), The Collected Works of J. Richard Büchi, Springer, Berlin, 1990, pp. 518-524.
11. Y. Gurevich, L. Harrington, Trees, automata and games, in: Proc. 14th ACM Symp. on the Theory of Computing, 1982, pp. 60-65.
12. R. Kaivola, Fixpoints for Rabin tree automata make complementation easy, in: ICALP'96, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 312-323.
13. A.S. Kechris, Classical Descriptive Set Theory, Springer, Berlin, 1995.
14. N. Klarlund, Progress measures, immediate determinacy, and a subset construction for tree automata, Ann. Pure Appl. Logic 69 (1994) 243-268.
15. N. Klarlund, D. Kozen, Rabin measures and their applications to fairness and automata theory, in: Proc. 6th Symp. on Logic in Comp. Sci., 1991.
16. K. Kuratowski, Topologie, vol. 1, Państwowe Wydawnictwo Naukowe, Warszawa, 1958, reprinted by Editions Jacques Gabay, 1992.
17. H. Lescow, On polynomial-size programs winning finite-state games, in: P. Wolper (Ed.), Computer Aided Verification, Lecture Notes in Computer Science, vol. 939, Springer, Berlin, 1995, pp. 239-252.
18. D. Martin, Borel determinacy, Ann. Math. 102 (1975) 363-371.
19. R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65 (1993) 149-184.
20. A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, in: 5th Symp. Computation Theory, Lecture Notes in Computer Sciemce, vol. 208, Springer, Berlin, 1984, pp. 157-168.
21. A.W. Mostowski, Games with forbidden positions, Technical Report 78, Uniwersytet Gdański, Instytut Matematyki, 1991.
22. A. Muchnik, Games on infinite trees and automata with dead-ends. A new proof for the decidability of the monadic second-order theory of two successors, Bull. EATCS 48 (1992) 220-267. Russian version in Semiotics and Information 24 (1984).
23. A. Muchnik, Games on infinite trees and automata with dead-ends. A new proof for the decidability of the monadic second-order theory of two successors, Bull. EATCS 48 (1992) 220-267. Russian version in Semiotics and Information 24 (1984).
24. D.E. Muller, P.E. Schupp, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, Theoret. Comput. Sci. 141 (1995) 69-107.
25. D. Perrin, J.E. Pin, Mots infinis, Technical Report 93.40, LITP, 1993.
26. M.O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969) 1-35.
27. M.O. Rabin, Automata on infinte objects and Church's problem, Conf. Board of Mathematical Sciences, vol. 13, American Mathematical Society, Providence, RI, 1972.
28. S. Safra, Exponential determinization for ω-automata with strong-fairness acceptance condition, in: Proc. of 24th ACM Symp. on the Theory of Computing, 1992, pp. 275-282.
29. W. Thomas, On the synthesis of stategies in infinite games, in: STACS 95, Lecture Notes in Computer Science, vol. 900, Spinger, Berlin, 1995.
30. W. Thomas, Languages, automata, and logic, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer, Berlin, 1997.
31. A. Yakhnis, V. Yakhnis, Extension of Gurevich-Harrington's restricted determinacy theorem: a criterion for the winning player and an explicit class of winning strategies, Ann. Pure Appl. Logic 48 (1990) 277-279.
32. S. Zeitman, Unforgettable forgetful determinacy, J. Logic Comput. 4 (1994) 273-283.