Tips on Using the Pumping Lemma to Prove Languages are Not Regular (Theory of Computing)
3In today's lecture, Dr. Page gives some tips on using the pumping lemma for proving languages are not regular. This is some general discussion, so enjoy! We'll do some more examples proving languages are not regular in the next set of lectures!
Time Stamps:
0:00 Recap, what is the pumping lemma and how do we use it in a contradiction proof...
12:37 Decomposing x,y,z, you don't have a choice of these but picking w right will help a ton!
23:07 Be careful picking w...
35:45 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
#tcs
#computerscience
#automatatheory