Formalization of the pumping lemma for context-free languages

Autor: Ramos, M. V. M., Queiroz, R. J. G. B., Nelma Moreira, Almeida, J. C. B.

Publikováno v: Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Journal of Formalized Reasoning, Vol 9, Iss 2, Pp 53-68 (2016)
Scopus-Elsevier

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 contex

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df40826a19368d1ec35f5d9516210faa
https://hdl.handle.net/1822/50517