Alternating weak automata from universal trees
From MaRDI portal
Recommendations
Cites work
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- An automata-theoretic approach to branching-time model checking
- Deciding parity games in quasipolynomial time
- Deciding the topological complexity of Büchi languages
- Deciding the weak definability of Büchi definable tree languages
- scientific article; zbMATH DE number 1332657 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- scientific article; zbMATH DE number 3999901 (Why is no real title available?)
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- On the power of bounded concurrency I
- On the Way to Alternating Weak Automata
- Succinct progress measures for solving parity games
- Universal graphs and good for games automata: new tools for infinite duration games
- Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
- Weak alternating automata are not that weak
Cited in
(8)- scientific article; zbMATH DE number 1670757 (Why is no real title available?)
- scientific article; zbMATH DE number 168434 (Why is no real title available?)
- The Theory of Universal Graphs for Infinite Duration Games
- On the Way to Alternating Weak Automata
- Universal algorithms for parity games and nested fixpoints
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Practical applications of the alternating cycle decomposition
- The Strahler number of a parity game
This page was built for publication: Alternating weak automata from universal trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875379)
