Could someone provide an explanation of how to convert this DFA into a regular expression? I have found three methods online, ie: How to convert finite automata to regular expressions?
but they are all very confusing to me.
The automaton is:
$$M = ((1,2,3), 1, \{a,b\}, \delta, \{1,3\})$$ where
$$\delta(1,a) = 2\\ \delta(1,b) = 2\\ \delta(2,a) = 2\\ \delta(2,b) = 3\\ \delta(3,b) = 2\\ \delta(3,a) = 1$$
