107
click to vote
DLT
2009
15 years 24 days ago
2009
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 p...