On Determinisation of Good-for-Games Automata
From MaRDI portal
Publication:3449484
DOI10.1007/978-3-662-47666-6_24zbMATH Open1440.68158OpenAlexW2405152255MaRDI QIDQ3449484FDOQ3449484
Michał Skrzypczak, Denis Kuperberg
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_24
Recommendations
- scientific article; zbMATH DE number 7649927
- 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
- The determinacy of context-free games
- The determinacy of context-free games
Cites Work
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Testing and generating infinite sequences by a finite automaton
- Title not available (Why is that?)
- Solving Sequential Conditions by Finite-State Strategies
- Solving Games Without Determinization
- Forms of determinism for automata
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- Nondeterminism in the Presence of a Diverse or Unknown Future
Cited In (25)
- Title not available (Why is that?)
- Achieving Unbounded Resolution inFinitePlayer Goore Games Using Stochastic Automata, and Its Applications
- Width of Non-deterministic Automata
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating good-for-MDPs automata
- Minimization of automata for liveness languages
- On the power of finite ambiguity in Büchi complementation
- Title not available (Why is that?)
- Half-positional objectives recognized by deterministic Büchi automata
- Token Games and History-Deterministic Quantitative-Automata
- How Deterministic are Good-For-Games Automata?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Minimizing GFG Transition-Based Automata
- Title not available (Why is that?)
- History-deterministic timed automata
- Semantic flowers for good-for-games and deterministic automata
- Checking history-determinism is NP-hard for parity automata
- On (I/O)-Aware Good-For-Games Automata
- On history-deterministic one-counter nets
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
- History-deterministic timed automata are not determinizable
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)
