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

DOI10.2307/2273681MaRDI QIDQ3679155zbMATH OpenOpenAlexFDO

Authors 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

decision proceduresgamessecond order monadic theorieswinning strategies

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(11)

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Determinization and memoryless winning strategies
• Games for synthesis of controllers with partial observation.
• Monadic second-order logic on tree-like structures
• Dynamic control with indistinguishable events
• Index appearance record with preorders
• Topological extension of parity automata
• scientific article; zbMATH DE number 2040951 (Why is no real title available?)
• Permissive strategies: from parity games to safety games
• Gurevich-Harrington's games defined by finite automata
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679155)