On Determinisation of Good-for-Games Automata
From MaRDI portal
(Redirected from Publication:3449484)
Recommendations
- Good for games automata: from nondeterminism to alternation
- On (I/O)-Aware Good-For-Games Automata
- Good-for-games \(\omega \)-pushdown automata
- scientific article; zbMATH DE number 7471692
- On a class of finite automata games
- How deterministic are good-for-games automata?
- Universal graphs and good for games automata: new tools for infinite duration games
- scientific article; zbMATH DE number 7447732
Cites work
- Are good-for-games automata good for probabilistic model checking?
- Forms of determinism for automata
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- Nondeterminism in the presence of a diverse or unknown future
- Solving Games Without Determinization
- Solving Sequential Conditions by Finite-State Strategies
- Testing and generating infinite sequences by a finite automaton
- The Theory of Stabilisation Monoids and Regular Cost Functions
Cited in
(41)- Eventually safe languages
- Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
- Width of non-deterministic automata
- scientific article; zbMATH DE number 7447732 (Why is no real title available?)
- Canonicity in GFG and transition-based automata
- scientific article; zbMATH DE number 7471692 (Why is no real title available?)
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Minimizing GFG Transition-Based Automata
- Minimization and canonization of GFG transition-based automata
- How deterministic are good-for-games automata?
- Good-for-games \(\omega \)-pushdown automata
- Computing the width of non-deterministic automata
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Nondeterminism in the presence of a diverse or unknown future
- Are good-for-games automata good for probabilistic model checking?
- Good for games automata: from nondeterminism to alternation
- On the power of finite ambiguity in Büchi complementation
- On history-deterministic one-counter nets
- Minimization of automata for liveness languages
- Alternating good-for-MDPs automata
- History-deterministic timed automata are not determinizable
- Semantic flowers for good-for-games and deterministic automata
- On (I/O)-Aware Good-For-Games Automata
- On the size of good-for-games Rabin automata and its link with the memory in Muller games
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Half-positional objectives recognized by deterministic Büchi automata
- Checking history-determinism is NP-hard for parity automata
- History-deterministic timed automata
- Minimising good-for-games automata is NP-complete
- Positional \(\omega\)-regular languages
- A hierarchy of nondeterminism
- Strategic dominance: a new preorder for nondeterministic processes
- Lookahead games and efficient determinisation of history-deterministic Büchi automata
- Positionality in ^0_2 and a completeness result
- History-deterministic Parikh automata
- Deciding what is good-for-MDPs
- History-deterministic Parikh automata
- Positional -regular languages
- Positionality in _0² and a completeness result
- On the minimisation of deterministic and history-deterministic generalised (co)Büchi automata
This page was built for publication: On Determinisation of Good-for-Games Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449484)
