Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/90765| Author(s): | Marcus VinÃcius Midena Ramos Ruy de G B d Queiroz Nelma Moreira JosÃ(c) Carlos Bacelar Almeida |
| Title: | Formalization of the Pumping Lemma for Context-Free Languages |
| 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. |
| DOI: | 10.6092/issn.1972-5787/5595 |
| URI: | https://hdl.handle.net/10216/90765 |
| Document Type: | Artigo em Revista Científica Internacional |
| Rights: | openAccess |
| Appears in Collections: | FCUP - Artigo em Revista Científica Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 107473.pdf | 122.71 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.