Pumping Lemma for anb2n+1 -
i know how solve pumping lemma anbn :n>=0 don't understand how can solve example : anb2n+1 :n>=0
i tried solve not sure have solved correctly or not?could please me here?
i can show how did solve it. not sure correct or not. please give me correct 1 if wrong.
question : prove anb2n+1 :n>=0 not regular.
here answer.
assume l regular. pumping lemma must hold. let m integer in pumping lemma.
let w=amb2m+1 in l. , |w|>=m
by pumping lemma w=xyz |xy|<=m , |y|>=1
according pumping lemma wi=xyiz in l i=0,1,2,...
let i=2 w2=xyyz.
let y=ak 1<=k<=m , x=aq 0<=q< m z=am-q-kb2m+1
w2=xyyz = aqakakam-q-kb2m+1
= am+kb2m+1
but not in l value of 1<=k<=m
so have contradiction pumping lemma. so, our assumption l regular wrong. so, l can not regular.
is correct???
thank you.
x=ak
y=aj
z=am-j-kb2m+1
taking i=m+2
have:
am+m+1b2m+1 ==> a2m+1b2m+1 isn't in l.
Comments
Post a Comment