Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/90765Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Marcus VinÃcius Midena Ramos | |
| dc.creator | Ruy de G B d Queiroz | |
| dc.creator | Nelma Moreira | |
| dc.creator | JosÃ(c) Carlos Bacelar Almeida | |
| dc.date.accessioned | 2022-09-12T01:39:57Z | - |
| dc.date.available | 2022-09-12T01:39:57Z | - |
| dc.date.issued | 2016 | |
| dc.identifier.issn | 1972-5787 | |
| dc.identifier.other | sigarra:107473 | |
| dc.identifier.uri | https://hdl.handle.net/10216/90765 | - |
| 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. | |
| dc.language.iso | eng | |
| dc.rights | openAccess | |
| dc.title | Formalization of the Pumping Lemma for Context-Free Languages | |
| dc.type | Artigo em Revista Científica Internacional | |
| dc.contributor.uporto | Faculdade de Ciências | |
| dc.identifier.doi | 10.6092/issn.1972-5787/5595 | |
| dc.identifier.authenticus | P-00G-T04 | |
| 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.