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?
$\begingroup$
$\endgroup$
1
-
1$\begingroup$ Does this answer your question? Languages that satisfy the pumping lemma but aren't regular? $\endgroup$– Hendrik JanJan 11 at 20:29
Add a comment
|