group theory 1multiple context-free languages 1rational subset membership 1substitution lemma 1word problem 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.FL2026
A substitution lemma for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel +1
The paper introduces a Substitution Lemma as a necessary condition for an infinite language to be multiple context‑free, uses it to prove that several languages—including the word…
cs.FL2025
Permutation closure for multiple context-free languages
Andrew Duncan, Murray Elder, Lisa Frenkel +1
We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure…