 Regular grammar

A right-linear regular grammar has productions of the forms $A\to wB$ and $A\to w$, where $A,B$ are variables and $w$ is a terminal word.

Regular grammar is a type of formal grammar that is used to define regular languages, which are among the simplest classes of languages in the Chomsky hierarchy. Regular grammars consist of a set of production rules that can be used to generate strings of a language.