On multiple context-free grammars
Theoretical Computer Science
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
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Characterizing structural descriptions produced by various grammatical formalisms
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
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 recognizer for minimalist languages
New developments in parsing technology
Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard
Language and Automata Theory and Applications
Dependency structures derived from minimalist grammars
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Closure properties of minimalist derivation tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Well-nestedness properly subsumes strict derivational minimalism
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
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
Strict deterministic aspects of minimalist grammars
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Movement-generalized minimalist grammars
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
| Hi-index | 0.00 |
In this paper we will fix the position of Minimalist Grammars as defined in Stabler (1997) in the hierarchy of formal languages. Michaelis (1998) has shown that the set of languages generated by Minimalist Grammars is a subset of the set of languages generated by Multiple Context-Free Grammars (Seki et al., 1991). In this paper we will present a proof showing the reverse. We thus conclude that Minimalist Grammars are weakly equivalent to Multiple Context-Free Grammars.