1,463 views

2 Answers

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

Related questions