Publicação
Formalization of the pumping lemma for context-free languages
| Resumo: | 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. |
|---|---|
| Autores principais: | Ramos, M. V. M. |
| Outros Autores: | Queiroz, R. J. G. B. de; Moreira, Nelma; Almeida, José Bacelar |
| Assunto: | Pumping lemma Context-free languages Ciências Naturais::Ciências da Computação e da Informação |
| Ano: | 2016 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso aberto |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| Resumo: | 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. |
|---|