International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Hierarchies of weak automata and weak monadic formulas
Theoretical Computer Science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Fixed point characterization of infinite behavior of finite-state systems
Theoretical Computer Science
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
A Hierarchy Theorem for the µ-Calculus
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Relating Hierarchies of Word and Tree Automata
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Linear game automata: decidable hierarchy problems for stripped-down alternating tree automata
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
The wadge hierarchy of deterministic tree languages
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On deciding topological classes of deterministic tree languages
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On topological completeness of regular tree languages
Logic and Program Semantics
On the topological complexity of weakly recognizable tree languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urbanski on deciding if a given deterministic Rabin automaton is equivalent to a nondeterministic Buchi automaton. The algorithm runs in the time of verifying the non-emptiness of nondeterministic parity automata.