On multiple context-free grammars
Theoretical Computer Science
LACL '96 Selected papers from the First 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
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
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
Some interdefinability results for syntactic constraint classes
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Minimalist grammars in the light of logic
Logic and grammar
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
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Insertion minimalist grammars: eliminating redundancies between merge and move
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
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
Geometric Representations for Minimalist Grammars
Journal of Logic, Language and Information
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
The change within the linguistic framework of transformational grammar from GB-theory to minimalism brought up a particular type of formal grammar, as well. We show that this type of a minimalist grammar (MG) constitutes a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). Moreover, an infinite hierarchy of MGs is established in relation to a hierarchy of LCFRSs.