In computer science a regular grammar is a formal grammar (N, Σ, P, S) such that all the production rules in P are of one of the following forms:
An example of a regular grammar G with N = {S, A}, Σ = {a, b, c}, P consists of the following rules
The regular grammars describe exactly all regular languages and are in that sense equivalent with finite state automata and regular expressions.
See also: Chomsky hierarchy