Proving Languages are Not Regular (via Pumping Lemma)

Last time we explored automata theory we proved the pumping lemma and seen how we can use it to prove a language is not regular. Today we explore this more, with plenty of more examples! Time Stamps: 0:00 Preshow 27:57 Lecture begins! Fill out our form to learn more when we can help you learn computer science together live: https://forms.gle/ergL8FrbHuAHctF3A Supporters (to date of publication, by tier (top to bottom)): ---------------------------------------------------------- Patreon Supporters (General Support): Draikou Patreon Supporters (Basic Support): Eric R. Patreon Supporters (Supporter Access!): ----------------------------------------------------------- Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content: PATREON: https://www.patreon.com/PageWizard SUBSCRIBESTAR: https://www.subscribestar.com/drpage Follow also at: FACEBOOK: https://www.facebook.com/DanielRPage TWITTER: https://twitter.com/PageWizardGLE QUORA: https://www.quora.com/profile/Daniel-... TWITCH: https://www.twitch.tv/pagewizard #computerscience #automata #tcs