Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing)
3Before we prove this claim, I thought it would be a good idea we get a recap of where we are and some intuition around the pumping lemma. Students tend to have a tricky time seeing where this comes from at first, so I wanted to spend some time playing around with DFAs to get where it might come from! Next we will see how we can prove the pumping lemma and some applications it has, such as for proving certain languages are not regular.
Time Stamps:
0:00 Recap of Regular Languages and concepts
6:53 Where will we go in future lessons?
8:09 What can we say about strings accepted by a DFA of a sufficiently long length? Pumping lemma primer.
20:38 Pumping Lemma for Regular Languages
27: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
#automata
#theoryofcomputation