Pumping Lemma for Regular Languages FULL PROOF

Here we give a proof of the pumping lemma for regular languages, one of the most important results in the entire class. The idea stems from what we did last time, in that we can prove that "other" strings exist in a given language provided that it is regular. We classify what those other strings' properties must have, and criteria in order to use the pumping lemma. It isn't useful in that it cannot help us prove that languages are regular, but it will help in proving languages are *not* regular. Easy Theory Website: https://www.easytheory.org GoFundMe: https://www.gofundme.com/f/easy-theory-video-studio Patreon: https://www.patreon.com/EasyTheoryYT Fourthwall: https://easy-theory-llc-shop.fourthwall.com Problem Solving channel: ​⁠ @easytheoryprobsolve Chapters: 0:00 - Introduction 1:30 - Can we guarantee a loop? 4:00 - Strings of length n see n+1 states 7:55 - Pumping Lemma statement 15:00 - Three properties of the Pumping Lemma If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1