Question

Prove that language Lon{a,b}, L={ vv = vR} is not regular.

Answer 1

we will that states : I then there is a 2= {ul v=UR } is not regular. prove this language he is not reguler using Pumping hemma for reguler languages, If A is a reguler language number p (the pumping length) whore if length atleast p , then s may be divided into three pieces xyz lyl>,0 > for each is,o ,xy'z eh laylep. s is any string in A s = 2 such that : L=4 abba, baba, aabaaban Let a be regular Let z = a aba abaa By pumping lemma 2= x y z Z CS Scanned with CamScanner

Let X= Cepsilon / null) y= =aa z = baabaa xy'z Eh vi, if his regular Now for i=o x y z l.A baabaa th Hence contrediction : Thus the given language is not reguler. CS Scanned with CamScanner