Possible Duplicate:How to prove that a language is not regular? Given a language $L = \{a^pb^{2p} \mid p \ge 1\}$, how could I show, using the Pumping Lemma that $L$ is not regular?
Show that a language is not regular using the Pumping Lemma
formal languages;regular languages;pumping lemma