Proving Languages not to be Regular

The pumping lemma for regular languages