Given a Finite Automata, we need to convert the Finite Automata into equivalent Regular Expression using the State Elimination Method.
Step 1 − Initial state q1 has incoming edge. So, create a new initial state qi.
Step 2 − Final state q2 has outgoing edge. So, create a new final state.
Step 3 − Start eliminating intermediate states one after another.
Now eliminate q2.
After eliminating q2 direct path from state qi to qf having cost.
c*a(d+bc*a) * ε=c*a(d+bc*a)*