How to prove that the language L={w1#w2#. . .#wk: k ≥ 2, each wi ∈ {0,1}^* , and wi = wj for some i !=j} is not context free using the pumping lemma?

1.2k Views Asked by At

I am having trouble choosing the string to use for the proof. I know that I have to choose a string such that at least two substrings separated by the # are equal to each other but am unsure of how to approach this. If someone could please help me with this, I would appreciate it.

1

There are 1 best solutions below

6
On BEST ANSWER

HINT: If $p$ is the pumping length, try $w=0^p1^p\#0^p1^p$.