The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-free Tree Grammars

Authors:
Stephan Kepser;Jim Rogers
Affiliations:
Collaborative Research Center 441, University of Tübingen, Tübingen, Germany;Computer Science Department, Earlham College, Richmond, USA
Venue:
Journal of Logic, Language and Information
Year:
2011

Citing 7
Cited 1

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
Closure properties of linear context-free tree languages with an application to optimality theory

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

Strong lexicalization of tree adjoining grammars

ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of an MSO-definable three-dimensional tree language.