Pumping Lemma + Examples -- Intro Theory of Computation Help Session #5

Here we go over the pumping lemma for regular languages as well as prove some languages are not regular, including proof strategies. This was recorded on 13 February 2017.

Timeline: 0:00 - Intro 4:00 - Pumping Lemma Statement 14:00 - Pumping Lemma Example 1 (0^n 1^n 2^n) 25:00 - Pumping Lemma Example 2 (0^3n 1^2n 2^n) 29:00 - Pumping Lemma Example 3 (Perfect Squares) 40:00 - Pumping Lemma Example 4 (Primes)

Easy Theory Website: https://www.easytheory.org Become a member: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg/join Donation (appears on streams): https://streamlabs.com/easytheory1/tip Paypal: https://paypal.me/easytheory Patreon: https://www.patreon.com/easytheory Discord: https://discord.gg/SD4U3hs

Merch: Language Hierarchy Apparel: https://teespring.com/language-hierarchy?pid=2&cid=2122 Pumping Lemma Apparel: https://teespring.com/pumping-lemma-for-regular-lang

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶SEND ME THEORY QUESTIONS◀ ryan.e.dougherty@icloud.com

▶ABOUT ME◀ I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes. ... https://www.youtube.com/watch?v=caNOYi1gkXA