Formalization of closure properties for context-free grammars
Formal Languages and Automata Theory
2015-06-11 v1
Abstract
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 ongoing formalization project using context-free grammars and the Coq proof assistant. The results obtained so far include the representation of context-free grammars, the description of algorithms for some operations on them (union, concatenation and closure) and the proof of related theorems (e.g. the correctness of these algorithms). A brief survey of related works is presented, as well as plans for further development.
Cite
@article{arxiv.1506.03428,
title = {Formalization of closure properties for context-free grammars},
author = {Marcus V. M. Ramos and Ruy J. G. B. de Queiroz},
journal= {arXiv preprint arXiv:1506.03428},
year = {2015}
}