On Deciding Topological Classes of Deterministic Tree Languages (original) (raw)
Related papers
E ective Topological Hierarchies of Recognizable Tree Languages
On the topological complexity of tree languages
2008
The Wadge Hierarchy of Deterministic Tree Languages
Logical Methods in Computer Science, 2008
On the Topological Complexity of Weakly Recognizable Tree Languages
Lecture Notes in Computer Science, 2007
Relating hierarchies of word and tree automata
1998
On the complexity of the syntax of tree languages
Lecture Notes in Computer Science, 2009
Effective Topological Hierarchies of
2008
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011
Tree Automata and Automata on Linear Orderings
Theoretical Informatics and Applications, 2009
On the separation question for tree languages
2012
Tree algebras and varieties of tree languages
Theoretical Computer Science, 2007
2008
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
IEEE Symposium on Foundations of Computer Science, 1991
Ambiguity Hierarchy of Regular Infinite Tree Languages
2020
On the formal points of the formal topology of the binary tree
Archive for Mathematical Logic, 2002
Probabilistic tree automata and context free languages
Israel Journal of Mathematics, 1970
Tree automata, mu-calculus and determinacy
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Relating word and tree automata
1996
Deterministic top-down tree automata: past, present, and future
2008
A Contraction Method to Decide MSO Theories of Deterministic Trees
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science, 2005
Systolic tree -languages: the operational and the logical view
Theoretical Computer Science, 2000
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing, 1999
Acceptance conditions for omega-languages and the Borel hierarchy
Tree automata techniques and applications
1997
Regular languages of nested words: Fixed points, automata, and synchronization
2007
Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata
Lecture Notes in Computer Science, 2009
Deterministic Automata and the Monadic Theory of Ordinals < ?2
Mlq, 1983
A kleene-like characterization of languages accepted by systolic tree automata
Journal of Computer and System Sciences, 1994
An automata-theoretical characterization of the OI-hierarchy
Information and control, 1986
Reasoning About Co–Büchi Tree Automata
Lecture Notes in Computer Science, 2005
Languages accepted by systolic Y-tree automata: structural characterizations
Domenico Parente, Emanuela Fachini
Acta Informatica, 1992
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy
Lecture Notes in Computer Science, 2014
Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1
2001