We want to construct a regular expression for the language accepted by the following DFA,

where

$Q=\{q_1,q_2,q_3\}$

$=\{a,b\}$

$q_1$ is the start state

$F=\{q_2,q_3\}$

$$ is given by

Provide a state diagram for this DFA

Construct a GNFA $($in the special form described in the textbook and in class$)$ equiv$-$

alent to this DFA. This involves creating new start and final states and $$ transitions.

Remove the state $q_1$ from this GNFA and show the result.

Remove the state $q_3$ from this GNFA and show the result.

Remove the state $q_2$ from this GNFA and show the result.