Pumping lemma

A tool to prove a language is not regular.