Journal of Formalized Reasoning (Dec 2016)

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

DOI
https://doi.org/10.6092/issn.1972-5787/5595
Journal volume & issue
Vol. 9, no. 2
pp. 53 – 68

Abstract

Read online

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.

Keywords