The pumping lemma, which gives a pretty good test to see if a language is regular or show that some languages are not regular. (There are also more general pumping lemmas that use pigeonhole for their proofs, but I don't know them.)
|
2 | added 5 characters in body | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
The pumping lemma, which gives a pretty good test to see if a language is regular or not. (There are also more general pumping lemmas that use pigeonhole for their proofs, but I don't know them.) |
||||
