On Two Hierarchies of Subregularly Tree Controlled Languages (original) (raw)
Related papers
Two collapsing hierarchies of subregularly tree controlled languages
Theoretical Computer Science, 2009
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Theoretical Computer Science, 2012
A Pumping Lemma Scheme for the Control Language Hierarchy
Pumping lemmas for the control language hierarchy
Mathematical Systems Theory, 1995
Decidability of Hierarchies of Regular Aperiodic Languages
Algebra and Logic, 2002
A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages
Lecture Notes in Computer Science, 2001
The Wadge Hierarchy of Deterministic Tree Languages
Logical Methods in Computer Science, 2008
Varieties of Tree Languages Definable by Syntactic Monoids
Acta Cybernetica, 2005
Syntactic monoids in the construction of systolic tree automata
1985
Tree Valence Controlled Grammars
International Journal on Perceptive and Cognitive Computing, 2017
Relating hierarchies of word and tree automata
1998
Tree algebras and varieties of tree languages
Theoretical Computer Science, 2007
On the separation question for tree languages
2012
Synchronized bottom-up tree automata and L-systems
Lecture Notes in Computer Science, 1985
2008
Ambiguity Hierarchy of Regular Infinite Tree Languages
2020
On the complexity of the syntax of tree languages
Lecture Notes in Computer Science, 2009
On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy
International Conference on Information System Implementation and Modeling, 2007
Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1
2001
E ective Topological Hierarchies of Recognizable Tree Languages
Rabin tree automata and finite monoids
Theoretical Computer Science, 1994
Journal of Computer and System Sciences, 1985
Mathematical Systems Theory, 1983
A note on deciding the controllability of a language K with respect to a language L
Automatic Control, IEEE Transactions on, 1993
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation, 2007
Algebraic properties of structured context-free languages: old approaches and novel developments
Eprint Arxiv 0907 2130, 2009
VARIETIES OF REGULAR ALGEBRAS AND UNRANKED TREE LANGUAGES
Bounded Repairability for Regular Tree Languages
ACM Transactions on Database Systems (TODS), 2016
C-grammars and tree-codifications
Journal of Computer and System Sciences, 1977
Demonstratio Mathematica
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science, 2005
Structurally and Arithmetically Controlled Grammars
International Journal on Perceptive and Cognitive Computing, 2016
Unconstrained optimal control of regular languages
Automatica, 2004
Tree Automata with Global Constraints Tree Automata with Global Constraints
2008
A kleene-like characterization of languages accepted by systolic tree automata
Journal of Computer and System Sciences, 1994