Formalization of the Pumping Lemma for Context-Free Languages
- Citation:
- Ramos MVM, Almeida JB, Moreira N, de Queiroz RJGB. 2016. Formalization of the Pumping Lemma for Context-Free Languages. Journal of Formalized Reasoning. 9(2):53-68.
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.
Citation Key:
RQMA16bTags
- Coq (2)
- formalization (1)
- language closure (1)
- MEE-CBC (1)
- Pumping Lemma (2)
- s2n library (1)
- timing attacks (1)
Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.