Transform regular grammar in linear grammar My problem is how can I transform a regular grammar into a linear grammar?

I know that a linear grammar has the form

$\begin{align} A &amp;\to w_1Bw_2 \\ 
               A &amp;\to w \end{align}$

where $A,B \in N$ and $w,w_1,w_2 \in \Sigma^*$.
A (right) regular grammar is one in which all production rules are of one of the following:

$$B \rightarrow a$$
$$B \rightarrow aC$$
$$B \rightarrow \lambda$$

Where $B$ is a non-terminal, $a$ is a terminal and $\lambda$ is the empty word. A regular grammar is a grammar which is either right-regular xor left-regular. As you have said in a linear grammar one does not require the nonterminals to appear on the far side of the right of the production rules. Therefore, every regular grammar is already a linear grammar.