Identity productions in regular grammar If a grammar is of the following form (i.e. all its productions are), is its language regular?


$B → a$ - where $B$ is a non-terminal in $N$ and a is a terminal in $Σ$
$B → aC$ - where $B$ and $C$ are in $N$ and $a$ is in $Σ$
$B → ε$ - where $B$ is in $N$ and $ε$ denotes the empty string, i.e. the string of length 0.
$B → A$ - where $A$ and $B$ are non-terminals in $N$


(1. - 3. quoted from wikipedia)

I only added the 4th rule and I assume that the language is regular. However, I cannot find any reference that supports this intuition.
Yes the language is regular.

Productions 2 and 3 are like transitions in a finite state automaton: $B \to aC$ is like moving from state $B$ to state $C$ while reading $a$; $B\to \varepsilon$ indicates that $B$ is like a final state where we can stop the computation (i.e., end the dirivation in grammar terminology).

The production $A\to B$ is like an $\varepsilon$-transition in finite state automata. This may be practical, but does not change the language generating capabilities of the grammars.