Determinization and Memoryless Winning Strategies

This publication has 11 references indexed in Scilit:

• Progress measures, immediate determinacy, and a subset construction for tree automata
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Tree automata, mu-calculus and determinacy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The complexity of tree automata and logics of programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Deciding full branching time logic
  Information and Control, 1984
• State-strategies for games in F_σδ ∩ G_δσ
  The Journal of Symbolic Logic, 1983
• Decision procedures and expressiveness in the temporal logic of branching time
  Published by Association for Computing Machinery (ACM) ,1982
• Trees, automata, and games
  Published by Association for Computing Machinery (ACM) ,1982
• Borel Determinacy
  Annals of Mathematics, 1975
• Solving sequential conditions by finite-state strategies
  Transactions of the American Mathematical Society, 1969
• Testing and generating infinite sequences by a finite automaton
  Information and Control, 1966