Pages that link to "Item:Q5136308"
From MaRDI portal
The following pages link to How Deterministic are Good-For-Games Automata? (Q5136308):
Displaying 10 items.
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- (Q5021013) (← links)
- Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- (Q5875380) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
- Token Games and History-Deterministic Quantitative-Automata (Q6178674) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)