Pumping Lemma For Regular LanguagesThis lecture shows an example of how to prove that a given language is Not Regular using Pumping Lemma.a^n b^n is not regular language where n greater then and equal to 1