Please use this identifier to cite or link to this item:
|Title:||Formalization of the Pumping Lemma for Context-Free Languages|
José Bacelar Almeida
|Abstract:||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.|
|Appears in Collections:||HASLab - Articles in International Journals|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.