Checking history-determinism is NP-hard for parity automata
From MaRDI portal
Publication:6629459
DOI10.1007/978-3-031-57228-9_11MaRDI QIDQ6629459
Publication date: 30 October 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Borel determinacy
- Fair simulation
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Advanced Ramsey-Based Büchi Automata Inclusion Testing
- On Determinisation of Good-for-Games Automata
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- The Complexity of Tree Automata and Logics of Programs
- On Distributive Fixed-Point Expressions
- Deciding Parity Games in Quasi-polynomial Time
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- How Deterministic are Good-For-Games Automata?
- Mathematical Foundations of Computer Science 2005
- Generalized Parity Games
- On history-deterministic one-counter nets
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
- Token Games and History-Deterministic Quantitative-Automata
This page was built for publication: Checking history-determinism is NP-hard for parity automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629459)
