2 votes 2 votes How to convert given finite state automaton into regular expression. Theory of Computation theory-of-computation finite-automata regular-expression + – tonystark007 asked Dec 8, 2017 edited Dec 8, 2017 by tonystark007 tonystark007 1.3k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments joshi_nitish commented Dec 8, 2017 reply Follow Share when you will remove q1, then loop 'xy' will be added on q0 as well as transition 'xy' will be added from q0->q2 1 votes 1 votes hs_yadav commented Dec 8, 2017 reply Follow Share 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) 1 votes 1 votes tonystark007 commented Dec 8, 2017 reply Follow Share I didn't knew how to handle this case. Thank you very much :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes " (X+Y)*X (Y(X+Y)X)* (X+Y) (Y+Z) " i got this RE suryaprakash answered Jan 14, 2018 suryaprakash comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (yz+(x+z))*(y+y+z) krmanish043 answered Jun 19, 2018 krmanish043 comment Share Follow See 1 comment See all 1 1 comment reply Divya Devi commented Nov 28, 2018 reply Follow Share Plz explain it with state elimination method 0 votes 0 votes Please log in or register to add a comment.