Regular Production Rule

languages

Definition

Regular Production Rule

A production rule is called regular if it is of form:

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

where $A,B\in N$ (non-terminal symbols), $a\in T$ (terminal symbol) and $\epsilon$ is the empty word.