International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Hierarchies of weak automata and weak monadic formulas
Theoretical Computer Science
The Borel hierarchy is infinite in the class of regular sets of trees
Theoretical Computer Science
Fast and simple nested fixpoints
Information Processing Letters
An improved algorithm for the evaluation of fixpoint expressions
Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
On Deciding if Deterministic Rabin Language Is in Büchi Class
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
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
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
On the topological complexity of weakly recognizable tree languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
It has been proved by Niwiński and Walukiewicz that a deterministic tree language is either Π$_{\rm 1}^{\rm 1}$-complete or it is on the level Π$_{\rm 3}^{\rm 0}$ of the Borel hierarchy, and that it can be decided effectively which of the two takes place. In this paper we show how to decide if the language recognized by a given deterministic tree automaton is on the Π$_{\rm 2}^{\rm 0}$, the Σ$^{\rm 0}_{\rm 2}$, or the Σ$^{\rm 0}_{\rm 3}$ level. Together with the previous results it gives a procedure calculating the exact position of a deterministic tree language in the topological hierarchy.