Course contentsShow
Computer Science
Lesson 1806 of 2,87240. Theory of Computation: Regular LanguagesPro lesson

The Pumping Lemma for Regular Languages

A necessary condition for regularity: sufficiently long strings must contain pumpable substrings.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.