Formalization of the pumping lemma for context-free languages
Context-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalizat...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Bologna
2016-12-01
|
| Series: | Journal of Formalized Reasoning |
| Subjects: | |
| Online Access: | https://jfr.unibo.it/article/view/5595 |