1 citations · 3 across the 4 of their papers we have counts for
5 papers
Formalization of context-free language theory
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira +1
Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, u…
Formalization of the pumping lemma for context-free languages
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz, Nelma Moreira +1
Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid fo…
Formalization of simplification for context-free grammars
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz
Context-free grammar simplification is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formaliza…
Formalization of closure properties for context-free grammars
Marcus V. M. Ramos, Ruy J. G. B. de Queiroz
Context-free language theory is a well-established area of mathematics, relevant to computer science foundations and technology. This paper presents the preliminary results of an o…
Context-Free Language Theory Formalization
Marcus Vinícius Midena Ramos, Ruy J. G. B. de Queiroz
Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program…