The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.
Theory Comput. Syst. Vol.55, pp.250-278 (2014), [peer-reviewed]
Abstract / 概要
Seki et al. (Theor. Comput. Sci. 88(2):191–229, 1991) showed that every m-multiple context-free language L is weakly 2m-iterative in the sense that e