There is a non-regular language that exists the pumping lemma for regular language?
I didn't find one.
Edit: From what i understood the pumping lemma does not prove that it is a regular language becuse there are non regular languages that "support" the pumping lemma. Thanks.
