Theoretical Computer Science
On multiple context-free grammars
Theoretical Computer Science
Independent parallelism in finite copying parallel rewriting systems
Theoretical Computer Science
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Derivational Minimalism Is Mildly Context-Sensitive
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Characterization of Minimalist Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A note on the complexity of constraint interaction: locality conditions and minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
The copying power of well-nested multiple context-free grammars
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Importing montagovian dynamics into minimalism
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
Minimalist grammars (MGs) constitute a mildly context-sensitive formalism when being equipped with a particular locality condition (LC), the shortest move condition. In this format MGs define the same class of derivable string languages as multiple context-free grammars (MCFGs). Adding another LC to MGs, the specifier island condition (SPIC), results in a proper subclass of derivable languages. It is rather straightforward to see this class is embedded within the class of languages derivable by some well-nested MCFG (MCFGwn). In this paper we show that the embedding is even proper. We partially do so adapting the methods used in [13] to characterize the separation of MCFGwn- languages from MCFG-languages by means of a "simple copying" theorem. The separation of strict derivational minimalism from well-nested MCFGs is then characterized by means of a "simple reverse copying" theorem. Since for MGs, well-nestedness seems to be a rather ad hoc restriction, whereas for MCFGs, this holds regarding the SPIC, our result may suggest we are concerned here with a structural difference between MGs and MCFGs which cannot immediately be overcome in a nonstipulated manner.