TOC: Pumping Lemma (For Regular Languages)

This lecture discusses the concept of Pumping Lemma which is used to prove that a Language is not Regular.

Contribute: http://www.nesoacademy.org/donate

Website ► http://www.nesoacademy.org/
Facebook ► https://goo.gl/Nt0PmB
Twitter ► https://twitter.com/nesoacademy
Pinterest ► http://www.pinterest.com/nesoacademy/

Music:
Axol x Alex Skrindo - You [NCS Release]
https://www.youtube.com/watch?v=sA_p0rQtDXE