Formalization of the Pumping Lemma for Context-Free Languages
Formalization of the Pumping Lemma for Context-Free Languages
dc.contributor.author | Ramos,MarcusViniciusMidena | en |
dc.contributor.author | Queiroz,RuyJ.G.B.de | en |
dc.contributor.author | Moreira,Nelma | en |
dc.contributor.author | José Bacelar Almeida | en |
dc.date.accessioned | 2017-12-22T12:14:07Z | |
dc.date.available | 2017-12-22T12:14:07Z | |
dc.date.issued | 2016 | en |
dc.description.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. | en |
dc.identifier.uri | http://repositorio.inesctec.pt/handle/123456789/4754 | |
dc.identifier.uri | http://dx.doi.org/10.6092/issn.1972-5787/5595 | en |
dc.language | eng | en |
dc.relation | 5598 | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.title | Formalization of the Pumping Lemma for Context-Free Languages | en |
dc.type | article | en |
dc.type | Publication | en |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- P-00G-T04.pdf
- Size:
- 11.83 MB
- Format:
- Adobe Portable Document Format
- Description: