pumping lemma for context free languages

98 Views Asked by At

As part of the homework we were asked a question about context free languages, and the proof is done using the pumping lemma for CFL. (Prove that it is not a CFL, proof by negation.)

The question is as follows. enter image description here

If I could "ignore" the beginning of the word, we would surely know that language is not CFL (as knowing that it's not a CFL)

But what is the correct treatment at the beginning of the word? Is it really possible to ignore the initial part of the word by arguing that concatenation of a CFL with a CFL leads to a non-CFL?

Thank you

EDIT: Now when I look at the exercise again, I notice that the order of the characters does not matter, so it is not the language I mentioned above.().

Can anyone please give direction or explanation for a possible solution?