State-strategies for games in Fσδ ∩ Gδσ

DOI10.2307/2273681zbMath0565.03009OpenAlexW1949254612MaRDI QIDQ3679155

J. Richard Buchi

Publication date: 1983

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273681

zbMATH Keywords

gamesdecision procedureswinning strategiessecond order monadic theories

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (10)

Permissive strategies: from parity games to safety games ⋮ Determinization and memoryless winning strategies ⋮ Topological extension of parity automata ⋮ Index appearance record with preorders ⋮ Games for synthesis of controllers with partial observation. ⋮ Gurevich-Harrington's games defined by finite automata ⋮ Dynamic control with indistinguishable events ⋮ Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ Monadic second-order logic on tree-like structures

Cites Work

• Borel determinacy
• The monadic theory of order
• Weak Second‐Order Arithmetic and Finite Automata
• Testing and generating infinite sequences by a finite automaton
• Advances in Game Theory. (AM-52)

This page was built for publication: State-strategies for games in F_σδ ∩ G_δσ