Formalization of the pumping lemma for context-free languages
Formal Languages and Automata Theory
2015-10-19 v1
Abstract
Context-free languages (CFLs) 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.
Keywords
Cite
@article{arxiv.1510.04748,
title = {Formalization of the pumping lemma for context-free languages},
author = {Marcus V. M. Ramos and Ruy J. G. B. de Queiroz and Nelma Moreira and José Carlos Bacelar Almeida},
journal= {arXiv preprint arXiv:1510.04748},
year = {2015}
}