Regular Grammar

languages

Definition

Regular Grammar (Type-3)

A grammar $G=(N,T,P,S)$ is called regular (Type-3) if every production in $P$ is of one of the forms

$$A\to aB\text{or}A\to \epsilon$$

where $A,B\in N$, $a\in T$, and $\epsilon$ is the empty word.
Such a grammar (right-linear) generates exactly the regular languages.