TOC: Pumping Lemma (For Regular Languages) | Example 1

This lecture shows an example of how to prove that a given language is Not Regular using Pumping Lemma.

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

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

Music:
Axol x Alex Skrindo You [NCS Release]
   • Axol x Alex Skrindo  You | Electro H...