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

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)

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)

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

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)