Pumping Lemma for Regular Languages - 20 Examples
220,812 views
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: What are your favorite Comp Sci YouTube channels? · 84% confidenceA 2-hour-20 problem marathon applying the pumping lemma to 20 languages, showing how to choose the string and split argument in each case; a thorough practice resource for students.
What you'll learn
Twenty worked examples of using the pumping lemma to prove languages are not regular.
Video by Easy Theory, played through YouTube's embedded player.
Part of Pumping Lemma Proofs (Regular + Context-Free) - Easy Theory, "Intro" Theory of Computation Lectures - Easy Theory
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.