Question

Prove if the following languages are CFL or not.

       If L is a CFL, give its CFG. Otherwise, prove it by Pumping Lemma.

       If any closure property of CFL is applicable, apply them to simplify it before its proof.

1. L = {ww^Rw | w $\epsilon$ {a, b}*}
2. L = {aⁿb^jaⁿb^j| n >= 0, j >= 0}
3. L = {aⁿb^ja^jbⁿ| n >= 0, j >= 0}

Answer 1

the Langinge wwrwwe context free Language is hot. a ASSume that we Con te xt- free. pumping Length the Heye k ie congider the etring 912 k divide the string into 5 Pleces uVxyz byl>o wheye uvuxyeL vi E N resultingshring Languag The whe n the not does in exist cFL. ot SO а f кatкык cannat contain V and Фuрроес block of 2k as. any as from the string the Second uvzy2- uxz Considel

2K, K ao ab s in etring The fux eL and tohere k must be in the K the 8 le ng th fo llour a S fivst block nambal 8Ome contaln must Thus 2i, 2k a8. But as most at of block 'a block of 2k contain& Shivib contradichion Srade

h202ο i's A38Ume Language ihat this a cfL lemma length pumping k is he condi tion 3 vieN uv'wzy EL 9a bagb ab)aa 1b Y w V 1vwyln 6 vxl 2 uvior'y e L i 2 a a bab a a a b This string da n ot belong L not CFL

ta"b'ab 1m20 620} by singpumping only lemma we can pYove given not Language cFL cFL if give CEG we Then it is asb aAble A bAa Je it cfL.