The Pumping Lemma for Regular Languages [FULL PROOF] (Theory of Computing)

Channel:

PageWizard Games, Learning & Entertainment

Subscribers:

791

Published on April 5, 2023 2:15:00 PM ● Video Link: https://www.youtube.com/watch?v=49eh9xy-JO4

Duration: 29:54

17 views

3

In today's lecture, we prove the pumping lemma for regular languages. We will see in the next lesson how we can use it to prove certain languages are not regular. Here we prove the pumping lemma itself and recap our introduction last time!

Time Stamps:
0:00 Recap of the Pumping Lemma
2:44 Proof of the Pumping Lemma
29:34 Closing

Have a beautiful day!

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
PAYPAL: https://paypal.me/pagewizard

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard

#ComputerScience
#automatatheory
#pumpinglemma