Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/4754
Title: Formalization of the Pumping Lemma for Context-Free Languages
Authors: Ramos,MarcusViniciusMidena
Queiroz,RuyJ.G.B.de
Moreira,Nelma
José Bacelar Almeida
Issue Date: 2016
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.
URI: http://repositorio.inesctec.pt/handle/123456789/4754
http://dx.doi.org/10.6092/issn.1972-5787/5595
metadata.dc.type: article
Publication
Appears in Collections:HASLab - Articles in International Journals

Files in This Item:
File SizeFormat 
P-00G-T04.pdf12.11 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.