The end of pumping?
A new lemma is introduced for regular languages. This lemma is simpler than the pumping lemma, and yet it is equally useful. By providing an elementary proof, together with several typical application examples, it is shown that the new lemma is better suited for educational purposes.
Saved in:
| Published in: | Theoretical computer science Vol. 174; no. 1; pp. 275 - 279 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
15-03-1997
|
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new lemma is introduced for regular languages. This lemma is simpler than the pumping lemma, and yet it is equally useful. By providing an elementary proof, together with several typical application examples, it is shown that the new lemma is better suited for educational purposes. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0304-3975 1879-2294 |
| DOI: | 10.1016/S0304-3975(96)00247-2 |