I am currently studying the pumping lemma for regular languages and I am trying to come up with an example where even if the language can be pumped it is not regular. Which condition of the lemma should be broken such that I can find a language like that?
Asked
Active
Viewed 121 times
