0
3.1kviews
Pumping Lemma for regular languages
1 Answer
2
74views

Pumping lemma is a negativity test which is used to determine whether a given language is non-regular

If a language passes the pumping lemma, it doesn‟t mean that the language is regular; it simply means that it is non-regular

There are two kinds of pumping lemma one for regular languages …

Create a free account to keep reading this post.

and 2 others joined a min ago.

Please log in to add an answer.