A digital service from FCT Publication
Formalization of the Pumping Lemma for Context-Free Languages
| Summary: | 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 formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages. |
|---|---|
| Country: | Portugal |
| Document type: | journal article |
| Access type: | Open |
| Associated institution: | Repositório Aberto da Universidade do Porto |
| Language: | English |
| Origin: | Repositório Aberto da Universidade do Porto |
| Summary: | 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 formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages. |
|---|