Minimalist tree languages are closed under intersection with recognizable tree languages

Authors:
Gregory M. Kobele
Affiliations:
University of Chicago
Venue:
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Year:
2011

Citing 6
Cited 4

The string generating power of context-free hypergraph grammars

Journal of Computer and System Sciences
Monadic second-order definable graph transductions: a survey

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Context-free graph grammars

Handbook of formal languages, vol. 3
Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
The MSO Logic-Automaton Connection in Linguistics

LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences

Top-down recognizers for MCFGs and MGs

CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Movement-generalized minimalist grammars

LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Importing montagovian dynamics into minimalism

LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Locality and the complexity of minimalist derivation tree languages

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimalist grammars are a mildly context-sensitive grammar framework within which analyses in mainstream chomskyian syntax can be faithfully represented. Here it is shown that both the derivation tree languages and derived tree languages of minimalist grammars are closed under intersection with regular tree languages. This allows us to conclude that taking into account the possibility of 'semantic crashes' in the standard approach to interpreting minimalist structures does not alter the strong generative capacity of the formalism. In addition, the addition to minimalist grammars of complexity filters is easily shown using a similar proof method to not change the class of derived tree languages.