How Deterministic are Good-For-Games Automata?
From MaRDI portal
Publication:5136308
DOI10.4230/LIPIcs.FSTTCS.2017.18zbMath1491.68096arXiv1710.04115OpenAlexW2963072428MaRDI QIDQ5136308
Michał Skrzypczak, Udi Boker, Orna Kupferman
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.04115
Related Items (8)
On history-deterministic one-counter nets ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Unnamed Item ⋮ Token Games and History-Deterministic Quantitative-Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable ⋮ Minimizing GFG Transition-Based Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reasoning about infinite computations
- Relating word and tree automata
- On Determinisation of Good-for-Games Automata
- Solving Games Without Determinization
- On the synthesis of strategies in infinite games
- On Distributive Fixed-Point Expressions
- Rabin vs. Streett Automata
- From linear time to branching time
- Nondeterminism in the Presence of a Diverse or Unknown Future
- TYPENESS FOR ω-REGULAR AUTOMATA
- Decision problems forω-automata
This page was built for publication: How Deterministic are Good-For-Games Automata?
