How to prove that Pumping lemma can't be used to prove regular languages.

492 Views Asked by At

I need a prove that pumping lemma can't be used to prove regular language. Pumping lemma is only used for proving non-regular language, but I need to show that how it can't be used to prove regular languages?