PUMPING LEMMA

• It is also known as “Negative testing”.

• It is a step by step process to show or prove
that language is regular or not regular.
 Difference between regular and not
regular language
Regular language Non-regular
any language language
consisting of a finite
any language
number of strings is
called regular language. consisting of infinite
number of strings is
 We ca draw its finite
called irregular
automata.
language.
 We can not draw its
finite automata.
 Examples of
Pumping Lemma
Prove that language is regular for all the strings
ending with “bbabb”?
1) Suppose language is regular. 1) Regular
2) If language is regular than we can 2) If language is regular than FA
make its finite automata. exist.
3) Suppose finite automata has 8
3) N=8
states.
4) Take word of length greater than 4) Word= aaba abb babb
i
states. 5) Length of X=4, Y=3, Z=4.
5) Divide the word into 3 parts i.e 6) XY Z
X,Y,Z (make sure that length of  i=1, aaba abb babb(WEL)
X+Y<=N)
 i= 2, aaba abbabb babb(WEL
6) X nad Z can be null but Y cannot
be null. Y>=1 7) All the conditions are
7) Output will decide whether the satisfied, so language is
language is regular or not. regular.
 Prove that language is regular for a n b 2n

1) Suppose language is regular. 1) Regular

2) If language is regular than we can 2) If language is regular than FA
make its finite automata. exist.
3) Suppose finite automata has 8 3) N=8
states. 4) Word= aaa bbb bbb
4) Take word of length greater than
5) Length
i of X=3, Y=3, Z=3.
states.
6) XY Z
5) Divide the word into 3 parts i.e
X,Y,Z (make sure that length of  i=1, aaa bbb bbb(WEL)
X+Y<=N)  i= 2, aaa bbbbbb bbb(WEL)
6) X nad Z can be null but Y cannot  i=3, aaa bbbbbbbbb bbb
be null. Y>=1 (WEL)
7) Output will decide whether the 7) All the conditions are satisfied,
language is regular or not. so language is not regular.