The equivalence of four extensions of context-free grammars
Mathematical Systems Theory
Tree-Adjoining Language Parsing in o(n^6) Time
SIAM Journal on Computing
TAL recognition in O(M(n2)) time
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
The equivalence of tree adjoining grammars and monadic linear context-free tree grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars
Journal of Logic, Language and Information
Deterministic recognition of trees accepted by a linear pushdown tree automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Hi-index | 0.89 |
In this paper, subclasses of monadic context-free tree grammars (CFTGs) are compared. Since linear, nondeleting, monadic CFTGs generate the same class of string languages as tree adjoining grammars (TAGs), it is examined whether the restrictions of linearity and nondeletion on monadic CFTGs are necessary to generate the same class of languages.