4. (30 points) Find the regular expressions for the following finite automata using the process we developed
when we proved the equivalence of regular expressions and regular languages. Show your work for
full credit.
(a) (0 points)
(b) (10 points)
1
0,1
0,1
1
start
1
2
3
0
0
0
0
start
1
2
3
4
0,1
1
1
(c) (10 points) automata must have one final state.]
start
1
1
0
0
2
1
1
3
0