Unforgettable Forgetful Determinacy

DOI10.1093/LOGCOM/4.3.273MaRDI QIDQ4304495zbMATH OpenOpenAlexFDO

Authors Suzanne Zeitman

Publication date 21 April 1997

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/4.3.273

zbMATH Keywords

decidabilityforgetful determinacy theoremgraph-gamesinfinite gamesmonadic second-order theoriesrestricted-memory strategieswinning strategy

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Games involving graphs (91A43)

Recommendations

• Memoryless determinacy of infinite parity games: another simple proof
• Memoryless determinacy of finite parity games: another simple proof
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
• Memoryless determinacy of parity and mean payoff games: a simple proof
• scientific article; zbMATH DE number 3983141

Cited in

(8)

• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Undescribable Events
• Groups, graphs, languages, automata, games and second-order monadic logic
• Forgetting Memories and Their Attractiveness
• A general notion of uniform strategies
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Gurevich-Harrington's games defined by finite automata

This page was built for publication: Unforgettable Forgetful Determinacy

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