2 votes 2 votes How to get the automata for a language L for which the deterministic finite automata of language reverse of R is given? Theory of Computation theory-of-computation finite-automata + – Gopal G asked Apr 17, 2017 Gopal G 1.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes If I'll go for d logic sake, if d DFA of language of reverse of R is given then certainly the final states of given R shud be turned to Non-Final and vice versa. I hope u've got wat I want to convey. Tat is how d DFA'll be obtained. :) Devshree Dubey answered Apr 17, 2017 Devshree Dubey comment Share Follow See 1 comment See all 1 1 comment reply Rameez Raza commented Apr 17, 2017 reply Follow Share https://gateoverflow.in/60009/reversal-of-dfa 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes suppose their is a DFA D for language L then Caption if you make the start state of DFA D to final state and final state of DFA D to start state and reverse the direction of transition then the new DFA will accept the reverse of language L Rameez Raza answered Apr 17, 2017 Rameez Raza comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Rameez Raza commented Apr 19, 2017 reply Follow Share Yes u have to convert back to dfa I don't think there is another approach U can search on Google 0 votes 0 votes Ahwan commented May 5, 2017 reply Follow Share Right answer, but you cant complement NFA & reverse it. Rule says you can only do it with DFA. NFA is just for making problem simpler, these operations are not to do with NFA. I would feel more happy with the answer if you did convert it to DFA 1st while changing the final to nonfinal & reversing direction. 2 votes 2 votes commenter commenter commented Jul 19, 2019 reply Follow Share The example that you have given is not DFA. 0 votes 0 votes Please log in or register to add a comment.