Finite automata

Question

How to get the automata for a language L for which the deterministic finite automata of language reverse of R is given?

Answer 1

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. :)

Comments

https://gateoverflow.in/60009/reversal-of-dfa

Answer 2

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

Comments

Yes u have to convert back to dfa

I don't think there is another approach

U can search on Google

---

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.

---

The example that you have given is not DFA.