How to convert given finite state automaton into regular expression.
let we have removed q1 then what is the all transitions which may be lost....
1. q0->q1->q0 xy (it could be represented as self loop on q0)
2.q0->q1->q2 xy (it could be obtained by taking transition from qo->q2 as xy)