Question

Use the CFL (Context Free Language) Pumping Lemma to show each of the following
   language not to be context-free:
         
    a) {a^n b^n c^i | i < n}
    b) {www | w is a binary string over {0,1}}

SHOW ALL WORK AND LEAVE NO STEPS OUT!!

NEED THIS ASAP!

THANKS!!

Answer 1

Az = { and licn 1. Assume that t is confext free 2. Pumping lengo) Acording to condibim let n=3; 1=2 L=58 23 L={ada fbbcc} 3-Dinde Language noo Š Poses Uvxyz L={agabbb cc U-aca lu1=3 V. Б и яг string lenses On) -8 x=b6 )x)=2 case I - NxYILN o 4= C 14)=1 4covu Z -c Al- case 2: - NyJo. asow case 3 - L=uw xyz Do I will take i=2 tagada c636bcc3c3 L-saaabbbbbcccc} x feyled * Our Assumption is useng Because not as at's must te equal tut geht now we have 3a's 8565 and let na ten & = 4 3.423 shot possibles *) Uvixyizel for gore i L-ganindrich is not calexo hee

b = {www/WE50133 1. Assume that ' is context here 2 - Pumping Lengon Acceling to condroren Let w=0 L=40101013 3-Dinde Lafrage into 5 Psos UVXYZ U- 0 101=) L-21010 V- 1 lvl stong Length (n)=6 x=ol 1412 Y-0 XyIch 141-1 case 1 - 151 2 2-1 466 von cosear 1. 90 230 V cole 3.- L=uvixyz 120 i will take 12 L-0020160213 L-01101001 sfehled * Our Assumption is useng Becas sight now strong lengen 58' 8 con't dinde info 3 erley Sit Dots But www meons dinde 64 3 ahly. 8 can't be divided into 3 . te urxYZEL for gore i L={www/wE80133 is not context here
i am done perfectly

Anything doubtful or not understand just comment I will touch with you

Please thumbs-up for my effort

Thank you and all the best