3,747 views
4 votes
4 votes
When reversing a DFA, if there are more than one final states in initial DFA then after reversing it how to decide which state to declare the start state of reversed FA

3 Answers

6 votes
6 votes
If there is only one final state in initial DFA then, simply make that final state to initial state and initial state to final state and reverse all the transition. But, If there are more than one final states in initial DFA then, then the problem is that in reverse DFA there are more than one initial states which can't possible, For this:- consider an extra state and make e (epsilon) transition from it to all states which are final states in initial DFA and rest are same as above. And to obtaiin DFA convert it to DFA.
reshown by
4 votes
4 votes
If there are multiple final states in DFA then create a new final state and make epsilon transitions to this new state from all final states. The rest of the procedure remains same.
0 votes
0 votes
whenever you take compliment of DFA one thing should be remember that is final state change into nonfinal & non final state change into final state.
for taking compliment of DFA start state is same as initial DFA which means no change in start state.

Related questions

3 votes
3 votes
1 answer
1
aditi19 asked Dec 10, 2018
2,285 views
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state
3 votes
3 votes
2 answers
3
Akriti sood asked Nov 7, 2016
6,682 views
A palindrome is a string whose reversal is identical to the string. How many bit strings of length n are palindromes? 2⌈n⁄2⌉ 2(⌊ n/2⌋ ) 2⌈n⁄2⌉ -1 2(�...
2 votes
2 votes
2 answers
4
A_i_$_h asked Oct 8, 2017
1,246 views
Let L = { 0n 1n | n>=1 } U {0n 1 2n | n>=1}Then reverse of L isA) regularB)DCFLC)CFL but not DCFLD)none