0
3.1kviews
Pumping Lemma for regular languages
1 Answer
| written 7.9 years ago by |
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 …