Efficient parsing of well-nested linear context-free rewriting systems
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
On Mildly Context-Sensitive Non-Linear Rewriting
Research on Language and Computation
Disentangling notions of specifier impenetrability: late adjunction, islands, and expressive power
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
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
Chomsky-Schützenberger-type characterization of multiple context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Mildly non-projective dependency grammar
Computational Linguistics
| Hi-index | 0.00 |
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is pumpable at some 2m substrings. We prove a pumping lemma of the usual universal form for the subclass consisting of well-nested multiple context-free languages. This is the same class of languages generated by non-duplicating macro grammars and by coupled-context-free grammars.