Gurevich-Harrington's games defined by finite automata

DOI10.1016/0168-0072(93)90239-AzbMath0778.03010MaRDI QIDQ685082

Vladimir Yakhnis, Alexander Yakhnis

Publication date: 22 September 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

concurrent programfinite automaton modelalphabet of possible moves

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 2-person games (91A05) Automata and formal grammars in connection with logical questions (03D05)

Related Items (5)

Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game ⋮ McNaughton games and extracting strategies for concurrent programs ⋮ Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra ⋮ Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies ⋮ Infinite games played on finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
• The strict determinateness of certain infinite games
• Elementary induction on abstract structures
• A starvation-free solution to the mutual exclusion problem
• On some games which are relevant to the theory of recursively enumerable sets
• State-strategies for games in F_σδ ∩ G_δσ
• Unforgettable Forgetful Determinacy
• An Approach to a Unified Theory of Automata
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: Gurevich-Harrington's games defined by finite automata