FOR FREE CONTENT

Example:

 

 

Prove that the language L = {0n1n, n  0} is not a regular language by pumping lemma.