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

This publication has 8 references indexed in Scilit:

• An initial semantics for the μ-calculus on trees and Rabin's complementation lemma
  Theoretical Computer Science, 1995
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
  Theoretical Computer Science, 1995
• Progress measures, immediate determinacy, and a subset construction for tree automata
  Annals of Pure and Applied Logic, 1994
• Unforgettable Forgetful Determinacy
  Journal of Logic and Computation, 1994
• Infinite games played on finite graphs
  Annals of Pure and Applied Logic, 1993
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: a criterion for the winning player and an explicit class of winning strategies
  Annals of Pure and Applied Logic, 1990
• State-strategies for games in F_σδ ∩ G_δσ
  The Journal of Symbolic Logic, 1983
• Borel Determinacy
  Annals of Mathematics, 1975