Formalization of the pumping lemma for context-free languages

Marcus V M Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy José Guerra Barretto de Queiroz


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.


Coq, context-free languages, pumping lemma

Full Text:

PDF (English)

DOI: 10.6092/issn.1972-5787/5595

Copyright (c) 2016 Marcus V M Ramos

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.