Consider the language, L = {1k 0i 1i 0j 1j 0k | i,j,k>0}. Is this language context free?
I tried to find this using pumping lemma,
By intution,
If we consider , by the definition of pumping lemma for CFG, u and y to be 1k and 0k respectively and vwx to be string in between,
if we consider v to be in 1i and x to be in 0j and if the pump up the variables, surely string generated after pumping up wont be in the given language right?
Am I missing something?