Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees

We examine a class of infinite two-person games on finitely coloured graphs. The main aim is to construct finite memory winning strategies for both players. This problem is motivated by applications to finite automata on infinite trees. A special attention is given to the exact amount of memory needed by the players for their winning strategies. Based on a previous work of Gurevich and Harrington and on subsequent improvements of McNaughton we propose a unique framework that allows to reestablish and to improve various results concerning memoryless strategies due to Emerson and Jutla, Mostowski, Klarlund.

[1]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[2]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[3]  M. Rabin.  Automata on Infinite Objects and Church's Problem , 1972 .

[4]  Helmut Lescow,et al.  On Polynomial-Size Programs Winning Finite-State Games , 1995, CAV.

[5]  Nils Klarlund,et al.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[6]  Igor Walukiewicz,et al.  How much memory is needed to win infinite games? , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[7]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[8]  Nils Klarlund,et al.  Rabin measures and their applications to fairness and automata theory , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9]  Dirk Siefkes,et al.  The collected works of J. Richard Büchi , 1989 .

[10]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[11]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[12]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[13]  Vladimir Yakhnis,et al.  Extension of Gurevich-Harrington's Restricted Memory Determinacy Theorem: A Criterion for the Winning Player and an Explicit Class of Winning Strategies , 1990, Ann. Pure Appl. Log..

[14]  Wolfgang Thomas.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[15]  N. Klarlund.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992 .

[16]  A. Kechris.  Classical descriptive set theory , 1987 .

[17]  Roope Kaivola.  Fixpoints for Rabin Tree Automata Make Complementation Easy , 1996, ICALP.

[18]  R. Suzanne Zeitman,et al.  Unforgettable Forgetful Determinacy , 1994, J. Log. Comput..

[19]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[20]  Morton Davis,et al.  7. Infinite Games of Perfect Information , 1964 .

[21]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[22]  David E. Muller,et al.  Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..

[23]  Eric Berne,et al.  Games People Play , 1964 .

[24]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[25]  J. Richard Büchi.  State-Strategies for Games in F G , 1983, J. Symb. Log..

[26]  André Arnold,et al.  An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma , 1995, Theor. Comput. Sci..