Pages that link to "Item:Q2904793"
From MaRDI portal
The following pages link to The determinacy of context-free games (Q2904793):
Displaying 12 items.
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Winning strategies for infinite games: from large cardinals to computer science extended abstract (Q1885038) (← links)
- Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity (Q2827947) (← links)
- The determinacy of context-free games (Q2904793) (← links)
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- STACS 2004 (Q5309722) (← links)
- (Q5407043) (redirect page) (← links)
- An upper bound on the complexity of recognizable tree languages (Q5501862) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)