Pumping Lemma for Regular & Non-Regular Languages with Examples in Urdu/Hindi

In this lecture Pumping Lemma for Regular & Non-Regular Languages with Examples has been explained. Pumping Lemma is used to find out whether the language is regular or not. There are two types of language finite and infinite.Finite language in always regular. Infinite language may be a regular or may be non-regular. Pumping Lemma is one of the method to find language is regular or not. Pumping Lemma performs negative test.
if we apply pumping lemma test on language and language pass that test, than there will be no surety that language is regular or non-regular.
If language fail pumping lemma test, then it is sure that language is non-regular.

pumping lemma in automata theory
pumping lemma in urdu
pumping lemma in hindi
what is pumping lemma
pumping lemma examples
Pumping Lemma for Regular Languages
Pumping Lemma for Non-Regular Languages
pumping lemma
pumping lemma examples


#AZComputing
#PumpingLemma
#PumpingLemmaProof