Non Context Free Language

[twisterplus]

I was looking for a way to prove that the complement of the following language is non-context-free:

L={((0^n)(1^n))^m | m,n are integers greater than zero}

 

Thank you in advance

[bascule]

First, take the complement, then provide a proof-by-contradiction using the pumping lemma. Hope that helps.