Some applications of the formalization of the pumping lemma for context-free languages

Bibliographic Details
Main Author: Ramos, Marcus V. M.
Publication Date: 2019
Other Authors: Almeida, José Bacelar, Moreira, Nelma, de Queiroz, Ruy J. G. B.
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://hdl.handle.net/1822/66489
Summary: Context-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma for Context-Free Languages states a property that is valid for all context-free languages, which makes it a tool for showing the existence of non-context-free languages. This paper presents a formalization, extending the previously formalized Lemma, of the fact that several well-known languages are not context-free. Moreover, we build on those results to construct a formal proof of the well-known property that context-free languages are not closed under intersection. All the formalization has been mechanized in the Coq proof assistant.
id RCAP_c1fb72fd32b404c41d88300b1b6a97f1
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/66489
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Some applications of the formalization of the pumping lemma for context-free languagesnon-context-free languagesclosureintersectionpumping lemmaformalizationCoqEngenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e InformáticaScience & TechnologyContext-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma for Context-Free Languages states a property that is valid for all context-free languages, which makes it a tool for showing the existence of non-context-free languages. This paper presents a formalization, extending the previously formalized Lemma, of the fact that several well-known languages are not context-free. Moreover, we build on those results to construct a formal proof of the well-known property that context-free languages are not closed under intersection. All the formalization has been mechanized in the Coq proof assistant.- (undefined)ElsevierUniversidade do MinhoRamos, Marcus V. M.Almeida, José BacelarMoreira, Nelmade Queiroz, Ruy J. G. B.20192019-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/1822/66489eng1571-066110.1016/j.entcs.2019.07.010info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2025-04-12T04:29:01Zoai:repositorium.sdum.uminho.pt:1822/66489Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T15:14:08.102Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Some applications of the formalization of the pumping lemma for context-free languages
title Some applications of the formalization of the pumping lemma for context-free languages
spellingShingle Some applications of the formalization of the pumping lemma for context-free languages
Ramos, Marcus V. M.
non-context-free languages
closure
intersection
pumping lemma
formalization
Coq
Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Science & Technology
title_short Some applications of the formalization of the pumping lemma for context-free languages
title_full Some applications of the formalization of the pumping lemma for context-free languages
title_fullStr Some applications of the formalization of the pumping lemma for context-free languages
title_full_unstemmed Some applications of the formalization of the pumping lemma for context-free languages
title_sort Some applications of the formalization of the pumping lemma for context-free languages
author Ramos, Marcus V. M.
author_facet Ramos, Marcus V. M.
Almeida, José Bacelar
Moreira, Nelma
de Queiroz, Ruy J. G. B.
author_role author
author2 Almeida, José Bacelar
Moreira, Nelma
de Queiroz, Ruy J. G. B.
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Ramos, Marcus V. M.
Almeida, José Bacelar
Moreira, Nelma
de Queiroz, Ruy J. G. B.
dc.subject.por.fl_str_mv non-context-free languages
closure
intersection
pumping lemma
formalization
Coq
Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Science & Technology
topic non-context-free languages
closure
intersection
pumping lemma
formalization
Coq
Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Science & Technology
description Context-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma for Context-Free Languages states a property that is valid for all context-free languages, which makes it a tool for showing the existence of non-context-free languages. This paper presents a formalization, extending the previously formalized Lemma, of the fact that several well-known languages are not context-free. Moreover, we build on those results to construct a formal proof of the well-known property that context-free languages are not closed under intersection. All the formalization has been mechanized in the Coq proof assistant.
publishDate 2019
dc.date.none.fl_str_mv 2019
2019-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/1822/66489
url https://hdl.handle.net/1822/66489
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1571-0661
10.1016/j.entcs.2019.07.010
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833595184044048384

Similar Items