# Converting DFA to regular expression [duplicate]

I have the following DFA. (Yellow stated are accepting states.) I want to eliminate states step by step to find the regular expression of it.
In my steps, I think there is a bug because I do not know what to do with state 4.

• Additionally, it is convenient to have a single initial and a single final state. The target of the elimination procedure then is the reduce the automaton to a single edge from initial to final (with expression that captures the automaton). This is obtained by adding two new states, and $\varepsilon$-edges to/from the old initial/final states from/to the new initial/final state. – Hendrik Jan Oct 25 '14 at 11:58