Intro to Automata, Regular Grammars Homework:

$($V$)$ Construct an NFA for the following right linear grammar $G=(\{S,T),\{0,1\},S,P)$ where $P$ :

$S0,S1T,$

$T,T0T,T1T$

$($i$)$ Derive three different strings of length $3$

$($ii$)$ Verify that the three strings ae accepted by the NFA giving the extended transition

function.

$($iii$)$ Give an equivalent Regular Expression for the above