Nonregular languages: How to use the Pumping Lemma
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.
Watch video Nonregular languages: How to use the Pumping Lemma online without registration, duration hours minute second in high quality. This video was added by user lydia 05 November 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 86,696 once and liked it 3.2 thousand people.