The Pumping Lemma

[salvipascual]

It makes a lot of sense, thanks :)

[MisterJMO]

Usefull, very. Thank you!

[iUniXi]

You have to prove every factorisation of uvx to be false though, don't you? In order to show if a language is recognisable for it's given type.

[kinszhang]

It makes sense. Thanks a lot. But I think the proof is all about the what you choose as W. I was wondering how I can choose the right one in the first time.

[DoItTheWayIDo]

you rocked my day man......i learned from many books but this is easiest......yes it dis make sense to me .........thanks keep it up............

[sandeepmittal2011]

Thanks .. i did find hard to understand this concept in first hand myself.. any lecture on GNF.....

[YoungKrieger]

Thanks, man! You're great!

[raizand33]

nice accent, epic video thanks ;)

[rastarockett2]

thank you!

[TescaF]

thank you!!!

[vineysingh]

great. thank you sir

[dracodvana]

Thank you sir. Entirely understandable and blessedly brief. Was easy to apply to my own efforts. You're a lifesaver! :)

[SaritB423]

LIFE SAVER! thank you!

[grind55]

thank you man

[mosyemessy]

u mean the size is 2n+2?

[burny1]

@mosyemessy Yes well spotted i even said n+n+1+1 = 2n+1. 2n+2 is right

[TonEEsNightmare]

superb



[midoz82]

thx mate nice one keep so

[karmiris0721]

thx mate, very nice video.

[2121akis]

thx great lecture!!

[henriquetsc]

Thanks dude, saved my life ;D