This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1807 of 2,872·40. Theory of Computation: Regular LanguagesPro lesson
Using the Pumping Lemma to Prove Non-Regularity
Apply pumping lemma by contradiction to show languages like {0^n 1^n} are not regular.