Pumping Lemma for Regular Languages (Birthday Stream)
1Today we are learning another property of the regular languages and how we can use it to show some languages are not regular. We will explore the last part in more detail in a future lecture, the focus of today's lecture is to understand the pumping lemma and what it actually is, and some applications behind it!
Note: I must stress that when assuming the language is regular, the gameplan is to get to the bottom part of the board where the PL does not hold, that one of the conditions does not hold! Where I describe it as a "batting" process back and forth is somewhat misleading, unless you are playing a 2-player game.
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
#automatatheory
#theoryofcomputation