Gurevich-Harrington's games defined by finite automata

DOI10.1016/0168-0072(93)90239-AzbMATH Open0778.03010MaRDI QIDQ685082FDOQ685082

Authors: Alexander Yakhnis, Vladimir Yakhnis 

Publication date: 22 September 1993

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

Recommendations

• Infinite games played on finite graphs
• Finite automata play a repeated extensive game
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• scientific article; zbMATH DE number 4045161
• scientific article; zbMATH DE number 5954365

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)

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Behavior of finite and infinite automata in game situations
• Title not available (Why is that?)
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• The ground tree transducer game with identical tree automata
• Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
• On the inference of strategies
• Finitely repeated games with finite automata
• McNaughton games and extracting strategies for concurrent programs
• Title not available (Why is that?)
• Infinite games played on finite graphs
• Variations on a game of Gale (I): Coding strategies
• 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: Gurevich-Harrington's games defined by finite automata

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