I read that pumping lemma is sufficient condition to prove non regularity of languages but not necessary condition.
I know the first part that it is sufficient is true but not able to understand why is it not necessary. Can someone please help me with this statement?
