Nonregular languages: How to use the Pumping Lemma

Published: 05 November 2020
on channel: lydia

155,722

5.1k

We know that all regular languages must satisfy the pumping lemma. This means we can use the pumping lemma to prove that a language is NOT regular by showing that it does NOT satisfy the pumping lemma.

This video provides a little more intuition for how such a proof works.

If you aren't yet familiar with what exactly the pumping lemma is, check this video out first: • What is the Pumping Lemma

____________________
Additional resources:

Michael Sipser. 2006. Introduction to the Theory of Computation (2nd. ed.). International Thomson Publishing.
The main source of my Theory of Computation knowledge (a textbook). Read Chapter 1.4: Nonregular Languages to learn more about the pumping lemma and examples of the formal proofs.
_____________________

And as always, this video project could not have been done without the support and guidance of Audrey St. John at Mount Holyoke College, a truly incredible professor-mentor-human.

On this page of the site you can watch the video online Nonregular languages: How to use the Pumping Lemma with a duration of hours minute second in good quality, which was uploaded by the user lydia 05 November 2020, share the link with friends and acquaintances, this video has already been watched 155,722 times on youtube and it was liked by 5.1 thousand viewers. Enjoy your viewing!