Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation) скачать в хорошем качестве

Application of the Pumping Lemma: Not All Languages are Regular (Theory of Computation)

In today's lecture we see how to prove a language is not regular. We use the pumping lemma to do this, via contradiction! We can view this prospect like a 2-player game, which I would like to attribute to Hopcroft et al. in their classic text. Time Stamps: 0:00 Recap 0:06 Exploiting the propositional form of the Pumping Lemma, to derive a way to prove a language is not regular. 10:28 Proving our first non-regular language, the language where binary strings have equal numbers of 0s and 1s. 22:54 Closing Have a beautiful day! Supporters (to date of publication, by tier (top to bottom)): ---------------------------------------------------------- Patreon Supporters (General Support): Draikou Patreon Supporters (Basic Support): Patreon Supporters (Supporter Access!): Eric R ----------------------------------------------------------- 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:   / pagewizard   SUBSCRIBESTAR: https://www.subscribestar.com/drpage PAYPAL: https://paypal.me/pagewizard Follow also at: FACEBOOK:   / danielrpage   TWITTER:   / pagewizardgle   QUORA: https://www.quora.com/profile/Daniel-... TWITCH:   / pagewizard   #ComputerScience #pumpinglemma #automatatheory