Pages that link to "Item:Q752703"
From MaRDI portal
The following pages link to Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703):
Displaying 6 items.
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- McNaughton games and extracting strategies for concurrent programs (Q1919769) (← links)
