Pages that link to "Item:Q685082"
From MaRDI portal
The following pages link to Gurevich-Harrington's games defined by finite automata (Q685082):
Displaying 5 items.
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game (Q1657268) (← links)
- McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
