Computing the Rabin Index of a Parity Automaton
From MaRDI portal
Recommendations
- Index appearance record for transforming Rabin automata into parity automata
- Rabin-Mostowski index problem: a step beyond deterministic automata
- Computing the rabin index of a regular language of infinite words
- Ramsey-based analysis of parity automata
- Determinising parity automata
- scientific article; zbMATH DE number 1701356
- On calculating the Krohn-Rhodes decomposition of automata
- The Rabin index of parity games: its complexity and approximation
- DNA Computing
- On the computational complexity of P automata
Cites work
- Chain automata
- Computing the rabin index of a regular language of infinite words
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Depth-First Search and Linear Graph Algorithms
- Hierarchies of weak automata and weak monadic formulas
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 3591916 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- On ω-regular sets
- Structural complexity of -automata
- Testing and generating infinite sequences by a finite automaton
Cited in
(20)- Chain automata
- A gap property of deterministic tree languages.
- Automata on infinite trees
- Index appearance record with preorders
- New optimizations and heuristics for determinization of Büchi automata
- Index appearance record for transforming Rabin automata into parity automata
- Deciding low levels of tree-automata hierarchy
- Disjunctive form and the modal alternation hierarchy
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- From Spot 2.0 to Spot 2.10: What’s New?
- Practical applications of the alternating cycle decomposition
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Computing the rabin index of a regular language of infinite words
- Positional \(\omega\)-regular languages
- Positional -regular languages
- Constructing concise characteristic samples for acceptors of omega regular languages
- The complexity of simplifying -automata through the alternating cycle decomposition
- A robust measure on FDFAs following duo-normalized acceptance
- Optimal transformations of games and automata using Muller conditions
- The Rabin index of parity games: its complexity and approximation
This page was built for publication: Computing the Rabin Index of a Parity Automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953338)
