Marciani Normal Form of context-free grammars
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.
cs.FL↗