# Proving $L = \{0^i1^j0^i1^j\ |\ i+j > 0\}$ is not a context-free language [duplicate]

This question already has an answer here:

I have the language $L = \{0^i1^j0^i1^j\ |\ i+j > 0\}$ I and want to prove that it is not context-free by using the Pumping lemma for context-free languages. I am new to this field and I am having some problems with the constant $n$ given by the Pumping Lemma. I do not know how to express $i$ and $j$ in terms of $n$. I have come up with a few example of expressing $i$ and $j$ as $n$ but some cases are always left out.

## marked as duplicate by David Richerby, Yuval Filmus formal-languages StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Aug 16 '17 at 19:23

You do not need to express $i$ and $j$ in terms of $n$.
Now suppose $L$ were context-free; then there would exist an $n \geq 0$ such that for every $s \in L$ with $|s| \geq n$ there would be a partition of $s = uvwxy$ such that
1. $|vwx| \leq n$
2. $|vx| > 0$
3. $uv^iwx^iy \in L$ for all $i \geq 0$
Consider the example string $s = 0^n1^n0^n1^n$. Clearly, $s \in L$, and obviously $|s| \geq n$. You must now examine all the possible partitions of $s$ and show that none of them can satisfy all three of the above conditions.