Marciani Normal Form of context-free grammars
Formal Languages and Automata Theory
2016-11-08 v1
Abstract
In this paper, we prove the semidecidability of the problem of saying whether or not a context-free grammar generates a regular language. We introduce the notion of context-free grammar in Marciani Normal Form. We prove that a context-free grammar in Marciani Normal Form always generates a regular language.
Cite
@article{arxiv.1611.01866,
title = {Marciani Normal Form of context-free grammars},
author = {Giacomo Marciani},
journal= {arXiv preprint arXiv:1611.01866},
year = {2016}
}
Comments
preprint, 4 pages