Exercise 3.2.1: Here is a transition table for a DFA 0 1 92 qз *q3 q3 a) Give all the regular expressions Ri the state with integer number i Note: Think of state qi as if it were 123 550 b) Give all...

E

Extracted text: Exercise 3.2.1: Here is a transition table for a DFA 0 1 92 qз *q3 q3 a) Give all the regular expressions Ri the state with integer number i Note: Think of state qi as if it were 123 550 b) Give all the regular expressions R much as possible. Try to simplify the c) Give all the regular expressions R. Try to simplify the expressions as much as possible d) Give a regular expression for the language of the automaton e) Construct the transition diagram for the DFA and give a regular expres- sion for its language by eliminating state q2. *