Please use this identifier to cite or link to this item:
http://repositorio.inesctec.pt/handle/123456789/11225
Title: | Some Applications of the Formalization of the Pumping Lemma for Context-Free Languages |
Authors: | José Bacelar Almeida Ramos,MVM Moreira,N de Queiroz,RJGB |
Issue Date: | 2019 |
Abstract: | 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. |
URI: | http://repositorio.inesctec.pt/handle/123456789/11225 http://dx.doi.org/10.1016/j.entcs.2019.07.010 |
metadata.dc.type: | Publication conferenceObject |
Appears in Collections: | HASLab - Articles in International Conferences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
P-00R-0SH.pdf | 274.15 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.