scientific article; zbMATH DE number 3591916
From MaRDI portal
Publication:4158997
Cited in
(14)- Fine hierarchy of regular \(\omega\)-languages
- Fixed point characterization of infinite behavior of finite-state systems
- A gap property of deterministic tree languages.
- Ambiguous classes in \(\mu\)-calculi hierarchies
- -automata
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
- Kleene Algebra
- KAD
- Deciding low levels of tree-automata hierarchy
- Computing the Rabin Index of a Parity Automaton
- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
- Alternating finite automata on -words
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158997)
