Marciani Normal Form of context-free grammars

TL;DR

This paper proves the semidecidability of determining whether a context-free grammar generates a regular language and introduces Marciani Normal Form, which guarantees regularity for grammars in this form.

Contribution

It introduces Marciani Normal Form and proves that grammars in this form always generate regular languages, addressing a key decision problem.

Findings

Semidecidability of the regularity problem for context-free grammars

Introduction of Marciani Normal Form

Grammars in this form always generate regular languages

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.