An example of using the pumping lemma proof to prove a language is NOT regular.
No download links available.