Q$1,$ A$|$ Convert the NFA with an empty move into NFA without an empty move?

B suppose $L1=\{a^{n}b\},n0,L2=\{ab\}$ find closure properties of this regular languag$,$

$(2)$ Al explain with example decision properties for regular sets?

Ni convert a Moore machine to a Mealy machine?

Q$3)$ convert a Moore machine to a Mealy machine?

Q$4)$ Alexplain the feature of regular grammar?

$B||$ compare between context$-$free grammar and context$-$sensitive grammar?

Q$5)$ Alexplain the following grammar $($left or right$)$ and find the language?

$.SAi$

$A$ADh$|B|$

$Ba$

$B||$ convert the following regular grammar to NFA? $SAa|B|$

$S$aaB

$B$ bAa $a$

Q $6)$ convert the following NFA to regular grommon?