Theory of Computation: Pumping Lemma for CFL with Example (a^n b^n c^n)

[@dishendra.]

Finally someone explained it correctly! Thanks ma'am for your efforts.

[@turing4991]

You explained so easily, even my teachers couldn't in 4 lectures

[@mahmoudalkhatib1538]

thank you, but how do you know that u is always equals to a^n. it could be more and it although could be less?

[@LovepreetLovepreet-vw1ce]

everything seems normal until you hear n as yun, l as yul and x as yux 😏

[@devanshsingh2]

Sale padhai pe dhyan dele 😂

[@LovepreetLovepreet-vw1ce]

@@devanshsingh2 and m as yum 😂

[@purpleunicorn616]

This video is super helpful! I finally understand the pumping lemma for cfl :)

[@30benasabu65]

Madam I have a doubt like to take v^(i-1), i>0 is to given here i>=0 is taken . why is it so

[@joaohenrique03]

obrigado pela lição abraços do brasil 🇧🇷

[@arya_math3926]

This is wrong , you are not allowed to choose u , v , w , x ,y as you desire, but infact you should give a W(the string you choose to show the contradiction) as an example that works for every possible u,v... Basically what you can do to fix your solution is to brute force all possible ways to choose u,v... and show contradiction for all of them

[@joshe3499]

Mam how will prove { a^i b^i^2} is not CFL

[@asma5972]

it is CFL

[@DoAnhNhat-v3g]

I wish I knew your channel soonner

[@jyothithota1469]

Good explanation mam

[@SafalGupta]

Thank You mam! soo Help Full Lecture

[@roshan_codes]

Awesome. Thank you.

[@NikhilKumar-mz1jt]

Apply pumping lemma to following languages and understand why we cannot complete proof L = {anaba | = 0}

[@akhilrajkumar894]

Good lecture

[@noway8387]

Thanks

[@harigopi6203]

excellent

[@sakshilama419]

Pawariyan😂❤

[@jeenitamoger7858]

Thank you ma'am

[@shanugamer8309]

Great explanation mam thank you 💞

[@MEAREMLG]

Madam, bless your exotic beautiful mind

[@Divya88775]

Yen nhi n hota h😂

[@DavinderKumar-zf7kx]

😑