Toc RLG to LLG

Question

Construct right-linear grammar and left-linear grammar for the language
L ={aⁿb^m : n$\geq$2 , m$\geq$3}
Explanation about this....???

Answer 1

RegExp for Language $L = \big \{a^nb^m, n \ge 2, m\ge 3 \big \}$ is $aaa^*bbbb^*$

So,one of the Right Linear Grammar can be ::

$S \rightarrow aaB $
$ B \rightarrow aB\;|\;bC $
$ C \rightarrow bbD$
$D \rightarrow bD\;|\;\epsilon$

And one of the Left linear Grammar Can be :

$S \rightarrow Bbbb$
$B \rightarrow Bb\;|\;Aaa$
$A \rightarrow Aa\;|\;\epsilon$