scientific article; zbMATH DE number 7455749
From MaRDI portal
Publication:5021013
Orna Kupferman, Bader abu Radi
Publication date: 11 January 2022
Full work available at URL: https://arxiv.org/abs/2009.10885
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reasoning about infinite computations
- Fair simulation
- Relating word and tree automata
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Linear Automaton Transformations
- On Determinisation of Good-for-Games Automata
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Minimizing GFG Transition-Based Automata
- How Deterministic are Good-For-Games Automata?
- Good-for-games ω-Pushdown Automata
- Nondeterminism in the Presence of a Diverse or Unknown Future
- Depth-First Search and Linear Graph Algorithms
This page was built for publication:
