Here is a transition table for a DFA:$01$

q$1,$ q$2$ q$1$Exercise $3\mathrm{.}2\mathrm{.}1$ : Here is a transition table for a DFA:

a$)$ Give all the regular expressions $R_{ij}^{(0)}.$ Note: Think of state $q_i$ as if it were

the state with integer number $i.$

b$)$ Give all the regular expressions $R_{ij}^{(1)}.$ Try to simplify the expressions as

q$2$ q$3$ q$1$

$*$q$3$ q$3$ q$2$