I heard in my lecture that there are non regular languages which meet the requirements for the pumping lemma for regular languages but I never actually saw one. Does anybody have an example?
Asked
Active
Viewed 37 times
1
-
1Does this answer your question? Languages that satisfy the pumping lemma but aren't regular? – Hendrik Jan Jan 11 '23 at 20:29