How to prove that a language is not context-free using pumping lemma

Question

I'm trying to prove that that language isn't a context free:

$ L = \{ w11w \mid w\in \Sigma^* = \{0,1\}\}$

I succeed to prove that $L = ww$ isn't context free, but not the language above. What am I doing wrong?

Can you show in the question how you proved that ${ww | w\in \Sigma^*}$ isn't context-free? — John L., May 18 '19 at 17:02
Possible duplicate of How to prove that a language is not context-free? — David Richerby, May 25 '19 at 13:22

score 1 · Answer 1 · answered May 18 '19 at 18:02

1

Here is the simplest way. Suppose that your language were context-free, and consider its intersection with $0^*(10)^*110^*(10)^*$. Applying further simple manipulations, you reach the language $\{a^nb^mc^nb^m : n,m \geq 0\}$, which is known not to be context-free.

If you insist on using the pumping lemma, perhaps you can get inspiration from this argument.

answered May 18 '19 at 18:02

Yuval Filmus

276,994
27
311
503

Not sure how this inspires arguments using the pumping lemma, but at least it proves the statement. – D. Ben Knoble May 18 '19 at 18:07
It could suggest which word to pump. – Yuval Filmus May 18 '19 at 18:08

How to prove that a language is not context-free using pumping lemma

1 Answers1