Automata, Computability and Formal Languages

Construct a regular expression for the language accepted by the following DFA, defined as (Q, 2, 8,90, F) where Q = {91, 92, 93} = {, } Q is the start state F= {(1,93} a b 91 91 92 d is given by 92 93 93 93 91 93 1. Following the algorithm seen in class, create a GNFA from this DFA. This involves creating new start and final states and e transitions. 2. Then the algorithm removes the internal states one by one in arbitrary order. Since removing the states in a different leads to a different solution, to ease grading, please dontinue as follows: (a) Remove state q2 and show the result. (b) Remove state q and show the result. (c) Remove state q3 and show the result