1 votes 1 votes Convert the given Finite Automata to Regular Expression. Theory of Computation finite-automata regular-expression theory-of-computation + – Manish Chetwani asked Sep 13, 2017 Manish Chetwani 3.1k views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Ashwani Kumar 2 commented Sep 13, 2017 reply Follow Share @LeenSharma We know that regular Expressions are not unique (for the same language we can write more than one Regular Expression) but when we convert FA to RE, so in this case also we will get the same RE or can be different. Does it depends on the order in which we eliminate state?? 0 votes 0 votes Manish Chetwani commented Sep 13, 2017 reply Follow Share Is there any sequence that we can follow for state elimination method that gives us a more better evaluated RE. Like to get b(c+ab)∗d rather than getting (bc*a)*.(bc*d)?? 0 votes 0 votes shubham007 commented Aug 19, 2018 reply Follow Share b(ab + c)*d 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Pardon for handwriting .. Hope this helps :) Pawan Kumar 2 answered Sep 13, 2017 Pawan Kumar 2 comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Pawan Kumar 2 commented Nov 27, 2018 reply Follow Share I guess no.., (c+ab)* of b(c+ab)∗d can produce strings like abc, abcab, cab ..... so overall b(c+ab)∗d will produce babcd, babcabd, bcabd.... and none of them is produced by bc*d+b(ab) *d. 0 votes 0 votes Divya Devi commented Nov 28, 2018 reply Follow Share Now I am clear tnq sir 0 votes 0 votes Pawan Kumar 2 commented Nov 28, 2018 reply Follow Share Divya Devi ,No need to address me as Sir, I'm just an aspirant like you. Good luck :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes First of all it is not DFA In every state for every input alphabet transition is not defined nikunj answered Sep 13, 2017 nikunj comment Share Follow See all 0 reply Please log in or register to add a comment.