Answers are grounded in this paper and cite their sources.
We present a necessary condition that shows some languages are not multiple context-free, indicating implications for language theory.
We present a necessary condition for an infinite language to be multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of the group F 2 × F 2 . We also show that groups with multiple context-free word problem have decidable rational subset membership problem. Our result contrasts with previous work showing that the standard pumping lemma for context-free languages cannot be generalised to multiple context-free languages, and that weak variants of generalised Ogden’s lemma do not apply to multiple context-free languages.
No takes yet. Share an insight, caveat, or question.
Duncan et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: