The regular grammar for the language L= { $w\mid n_{a}$(w) and $n_{b} (w)$ are both even, $w \in \left\{a, b\right\}$ * } is given by : (Assume, $p, q, r$ and $s$ are states)
- $p \rightarrow aq \mid br \mid \lambda, q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$, $p$ and $s$ are initial and final states.
- $p \rightarrow aq \mid br , q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$, $p$ and $s$ are initial and final states.
- $p \rightarrow aq \mid br \mid \lambda , q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$ $p$ is both initial and final states.
- $p \rightarrow aq \mid br , q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$ $p$ is both initial and final states.