Pumping lenma fov RL:

Sta te &pYOve pumpinq lemma fov R-L.

be FA
Theore m Let M -
K,2, 8,s, AY ar

Ond has n no. of Sta tes

accepted 6M
Let L e the R-L
e xists
exiStS

let for
OT eveg
evevq In9 'x i n l theve Ixi2n.
kem(SA:
that
a conStant n . guch
XCan
be byoken into 3
Now, f the Stying
 UVamd w Such that
Sub Stimg

x uvw sa+ís fying folouwin conStraimts.

e, Iv 21

then uv'w i n L for iz0

be an FA
Proof Let m (K, 2, S, s, P).
Let Lb the anguage acceptek b4 FA &s

equlay
Cwbere m2 n
Let x a,a m-m
Heye n yepresen
and s tach a; 1s n

no of States of Fe:

have mi'npuk Sym bols na turally

Si nce e

we should have
m+ Sates Sequence.
the StaYt State E
Wheve

as Shean in belotw
be fimal staie
il

figure

not possi ble to have

Since x2n i t is
States must hov
dstinct tvanSitions. One of the
x is dviGed tmto 3
a lcop let the Stimg
Sub Stinqs as Showm belauo:
1S
SETng prfix ma,2
)The AYSt grouP
U= a , a 2 . . .

Second gYoap S the loop String fYom

The
a ie. V: Gi+} ,ai+2
a+1t2
[coi
1The thid qroup 1 styng ufx from af) a
am ) +11+2

oop
wheve i

above Aqure that, the efix stTin

observe from
machime from o to iThe loop sting
u takes

machi me from i to j . (9 ) an
takes
V
om to
saffix string
wtakes machine ; Lm
that Can be acceptecd bq
minimum string
The
withi=0 t cohen i=1 the
above
FA iS w
FA even
b obOve
st nguvw
S accepte
accepted bq FA
when
2 , the sti is
tne machine gpesfrom to .
So if>o
basee
u cincles rom q; to qi
On iPuF string ta atcePt ng
then goes
Of and
On value
ad. m general, f StrinqX
stning
State On thon for all i20
substvings uv
isspltinto

uv'w EL

ceytaln
that
to prOve
is used
Pum pin9 lemma annot be uSel
But i t
hot eqular
aYe
language íS reQular.
thet amguaqe
to PYOve
 )ASSume that lamquage S regular amd n be

Stades of FA CAngth x )
o of
x Such that
X2n and
bk
the strimg
) Select and w So that
SubStvings u V
itimto

constraints;
iv# ¬
wrth
)uvl En
not in L
hat uv IS
i Such
Cii)Find any is in l
lemma uv' w
o pumping
Accordirg to the ass=
(ontyadiCtion
vesult is
i20 S0 the
egul
is
Hion that languuage
is not vegulaY
.iven hrguage L
eg :ab w
w1eveNge d w

Pobem
LsowR|we
(o+* J is not egular
Show that
states in
is egalay and 'n be no. of
L
SG

Let
w
o

Considera styng *=

Step
the sty ing x im to u vaw
Since X2n split
Such that luviSn 4 w2 s shoon belo

X Od 0 - .0 1

luvl h+1:n

wheve lu= n- IVI =11 9o thaF

Acording
to
pup mg lemma uv'w E L or i20
VdoesS the
sep3:i :0
n o of 1'S On tho ft
nol appeaY
of x
and so

will be less tra

 . Of 'S on the YghH of So the ing
form wwR,
rot of
is

So a v ' L when i-0

thaf
ConfvadiCtion to ascumpti on
This is
anguage 6regular.

Iwelo+}* is not egulay

So L w IMoto
b'c2 luv n-
a rdt u rD matth
i

3T L a " n 20 is ot requlav
FA
letLbe reguaY& be no. of stakes in

Stepl
Conside a stYhg

stTing IDto uvw

Stepa
Sin ce
split
as showr beo
Such that alsn Iv2l

X d:.

v
l u v l = n 4 + 1 * n

SO that
Ivel
ul=n-
where uvw fL or izo
emma,
to pumping.
AccOYdimg
ot aPpear
o no. of a's
V does
=o 6S On
Sep3 no. D
thOn
bC ess a"b
X w 6 f form
-
On lef Of is, not
Stmg
So
O f

Cwhen = 0.
thay
sumpfon
ComtiadiCtton TC as
This i s
requl a r
anquage s

Lan,)n2o is pot regula