Pages that link to "Item:Q1357005"
From MaRDI portal
The following pages link to Determinization and memoryless winning strategies (Q1357005):
Displaying 7 items.
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Memoryless determinacy of finite parity games: another simple proof (Q1705645) (← links)
- Time-aware uniformization of winning strategies (Q2106605) (← links)
- Synthesis of finite-state and definable winning strategies (Q2920143) (← links)
- (Q2947758) (← links)
- Determinancy with Complicated Strategies (Q3715108) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)