2000 character limit reached
Marciani Normal Form of context-free grammars (1611.01866v1)
Published 7 Nov 2016 in cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.