Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Alternating automata on infinite trees
Theoretical Computer Science
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Hierarchies of weak automata and weak monadic formulas
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
The Borel hierarchy is infinite in the class of regular sets of trees
Theoretical Computer Science
Computing the Rabin index of a regular language of infinite words
Information and Computation
Languages, automata, and logic
Handbook of formal languages, vol. 3
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science
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
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A hierarchy of sets of infinite trees
Proceedings of the 6th GI-Conference on Theoretical Computer Science
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Borel Complexity of MSO Definable Sets of Branches
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Cardinality quantifiers in MLO over trees
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
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
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
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 Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
The Topological Complexity of MSO+U and Related Automata Models
Fundamenta Informaticae - Emergent Computing
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 that a tree language recognized by a deterministic parity automaton is either hard for the co-Büchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property is that a deterministic tree language is either Π11 complete (and hence nonBorel), or it is on the level Π30 of the Borel hierarchy. We also give a new simple proof of the strictness of the hierarchy of weak alternating automata.