The equivalence of tree adjoining grammars and monadic linear context-free tree grammars

Authors:
Stephan Kepser;James Rogers
Affiliations:
Collaborative Research Centre, University of Tübingen, Tübingen, Germany;Computer Science Department, Earlham College, Richmond, IN
Venue:
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Year:
2007

Citing 6
Cited 0

Tree languages

Handbook of formal languages, vol. 3
Tree-adjoining grammars

Handbook of formal languages, vol. 3
Descriptive Approach to Language - Theoretic Complexity

Descriptive Approach to Language - Theoretic Complexity
wMSO theories as grammar formalisms

Theoretical Computer Science - Algebraic methods in language processing
Linearity and nondeletion on monadic context-free tree grammars

Information Processing Letters
Tree adjunct grammars

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

Abstract

It has been observed quite early after the introduction of Tree Adjoining Grammars that the adjoining operation seems to be a special case of the more general deduction step in a context-free tree grammar (CFTG) derivation. TAGs look like special cases of a subclass of CFTGs, namely monadic linear CFTGs. More than a decade ago it was shown that the two grammar formalisms are indeed weakly equivalent, i.e., define the same classes of string languages. This paper now closes the remaining gap showing the strong equivalence for so-called nonstrict TAGs, a variant of TAGs where the restrictions for head and foot nodes are slightly generalised.