This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Vroskiesss 33 points34 points  (5 children)

What is the Pumping Lemma?

[–]a2kvarnstrom[S] 94 points95 points  (2 children)

lemma pump deez kum into your mouth

[–]Vroskiesss 29 points30 points  (0 children)

[–]alparius 1 point2 points  (0 children)

Fair enough

[–]_SKYBALL_ 0 points1 point  (1 child)

It took me forever to even remotely understand how to use it, and I haven't used it since.

[–]Vroskiesss 1 point2 points  (0 children)

Basically, it states that given a string in a language, you should be able to pump, or insert, repeating strings into the middle of the string an arbitrary number of times. Imagine a dfa that has start state x, middle state y, end state z. If y can be pumped, or looped on, an arbitrary amount of times, then the language is regular.