Languages accepted by systolic Y-tree automata: structural characterizations (original) (raw)
Related papers
A kleene-like characterization of languages accepted by systolic tree automata
Journal of Computer and System Sciences, 1994
Power of interconnections and of nondeterminism in regularY-tree systolic automata
Domenico Parente, Emanuela Fachini
Mathematical Systems Theory, 1995
Systolic tree -languages: the operational and the logical view
Theoretical Computer Science, 2000
A Logical Characterization of Systolic Languages
1998
Completeness Results Concerning Systolic Tree Automata and EOL Languages
Ipl, 1995
Completeness results concerning systolic tree automata and E0L languages
Information Processing Letters, 1995
Systolic Tree omega-Languages: The Operational and the Logical View
1995
Syntactic monoids in the construction of systolic tree automata
1985
Lecture Notes in Computer Science, 1995
2008
Tree Automata and Automata on Linear Orderings
Theoretical Informatics and Applications, 2009
A note about minimal non-deterministic automata
Bulletin of The European Association for Theoretical Computer Science, 1992
The Emptiness Problem for Tree Automata with Global Constraints
2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010
On Deciding Topological Classes of Deterministic Tree Languages
Lecture Notes in Computer Science, 2005
On complete systems of automata
Theoretical Computer Science, 2000
Relating word and tree automata
1996
Algebraic properties of structured context-free languages: old approaches and novel developments
Eprint Arxiv 0907 2130, 2009
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
Reasoning About Co–Büchi Tree Automata
Lecture Notes in Computer Science, 2005
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science, 2005
Tree Automata with Global Constraints Tree Automata with Global Constraints
2008
Automata Theory and Formal Languages
Texts in Computer Science, 2021
2016
An automata-theoretical characterization of the OI-hierarchy
Information and control, 1986
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
IEEE Symposium on Foundations of Computer Science, 1991
Tree automata techniques and applications
1997
A new family of nonstochastic languages
Information Processing Letters, 2010
On h-Lexicalized Restarting Automata
Electronic Proceedings in Theoretical Computer Science
Deterministic Automata and the Monadic Theory of Ordinals < ?2
Mlq, 1983
On h-Lexicalized Automata and h-Syntactic Analysis
ITAT, 2017
Language containment of non-deterministic Ω-automata
Lecture Notes in Computer Science, 1995
On the complexity of the syntax of tree languages
Lecture Notes in Computer Science, 2009
2013
Relating hierarchies of word and tree automata
1998
Tree Automata with Global Constraints
International Journal of Foundations of Computer Science, 2010