%0 Journal Article
%J Journal of Formalized Reasoning
%D 2016
%T Formalization of the Pumping Lemma for Context-Free Languages
%A Marcus V. M. Ramos
%A José Bacelar Almeida
%A Nelma Moreira
%A Ruy J. G. B. de Queiroz
%I University of Bolonha
%N 2
%P 53-68
%U https://jfr.unibo.it/article/view/5595
%V 9
%X <p>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.</p>
%> https://haslab.uminho.pt/sites/default/files/jba/files/16jfr.pdf