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

DOI10.2307/2273681zbMATH Open0565.03009OpenAlexW1949254612MaRDI QIDQ3679155FDOQ3679155

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

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

Cited In (11)

• Games for synthesis of controllers with partial observation.
• Monadic second-order logic on tree-like structures
• Permissive strategies: from parity games to safety games
• Title not available (Why is that?)
• 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
• 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)