On Determinisation of Good-for-Games Automata

DOI10.1007/978-3-662-47666-6_24zbMath1440.68158OpenAlexW2405152255MaRDI QIDQ3449484

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (17)

Unnamed Item ⋮ Unnamed Item ⋮ Width of Non-deterministic Automata ⋮ On the power of finite ambiguity in Büchi complementation ⋮ On history-deterministic one-counter nets ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Minimization of automata for liveness languages ⋮ Unnamed Item ⋮ History-deterministic timed automata are not determinizable ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Semantic flowers for good-for-games and deterministic automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable ⋮ Minimizing GFG Transition-Based Automata ⋮ How Deterministic are Good-For-Games Automata?

Cites Work

• Unnamed Item
• Forms of Determinism for Automata (Invited Talk)
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Nondeterminism in the Presence of a Diverse or Unknown Future
• Are Good-for-Games Automata Good for Probabilistic Model Checking?
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: On Determinisation of Good-for-Games Automata