Skip to content
Hallway
0:00 / 0:00

#pumpinglemma#automatatheory#formallanguages

Lecture 3 - The Pumping Lemma (Part 1/10)

Coderisland

14K subscribers • 2 videos on Hallway

YouTube
  • Recommended by 2 people: 2 in engineering communities.
  • Presented by Shai Simonson, Professor of Computer Science

Intermediate. Assumes working knowledge.

94K views16 years ago2 recommendations

Computer scienceComputation and complexityAlgorithms

Shai Simonson explains the pumping lemma for regular languages in this theory of computation lecture.

All rights reserved for aduni.org/ Published under the Creative Commons Attribution-ShareAlike license creativecommons.org/licenses/by-sa/2.0/ Tutorials by Instructor: Shai Simonson. stonehill.edu/compsci/shai.htm Visit our website at: coderisland.com Download Lecture Materials: coderisland.com/theory-of-computation-materials/ Follow us on twitter: twitter.com/coderisland Become a fan on Facebook: facebook.com/Coderisland

Why it's here

2 people recommend this

What people say. Recommended as a very helpful and clear explanation of the pumping lemma for exams.

u/myChairMyRulesin r/compsci • Recommends

On “The Pumping Lemma”

[How I learnt it for my exams last year: very handy. I did need to take notes every so often, but even so.] (link to this video
3View on Reddit

u/rekajin r/compsci • Recommends

On “Explain it like I'm 5: How do you use Pumping Lemma to prove that a language is irregular?”

This guy does a pretty good job.
1View on Reddit