Pages that link to "Item:Q3449484"
From MaRDI portal
The following pages link to On Determinisation of Good-for-Games Automata (Q3449484):
Displaying 24 items.
- Achieving Unbounded Resolution in<i>Finite</i>Player Goore Games Using Stochastic Automata, and Its Applications (Q2888572) (← links)
- Width of Non-deterministic Automata (Q3304146) (← links)
- (Q3384876) (← links)
- (Q5021013) (← links)
- (Q5028456) (← links)
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Q5039514) (← links)
- Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5101349) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- (Q5207047) (← links)
- (Q5232903) (← links)
- (Q5875380) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)
- Minimization of automata for liveness languages (Q6160912) (← links)
- Alternating good-for-MDPs automata (Q6160921) (← links)
- Token Games and History-Deterministic Quantitative-Automata (Q6178674) (← links)
- Semantic flowers for good-for-games and deterministic automata (Q6195342) (← links)
- On (I/O)-Aware Good-For-Games Automata (Q6485864) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
- Checking history-determinism is NP-hard for parity automata (Q6629459) (← links)
- History-deterministic timed automata (Q6635511) (← links)
