Minimalist tree languages are closed under intersection with recognizable tree languages

18Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kobele, G. M. (2011). Minimalist tree languages are closed under intersection with recognizable tree languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6736 LNAI, pp. 129–144). https://doi.org/10.1007/978-3-642-22221-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free