2,252 views
3 votes
3 votes
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

1 Answer

1 votes
1 votes
In dfa  reversal , we reverse the arrow and make initial to final and final to initial state.

if more than one final state we have then take epsilon transition from all final and make single initial state.

Related questions

0 votes
0 votes
1 answer
1
Lakshman Bhaiya asked Dec 27, 2018
543 views
Construct a minimal DFA which accepts set of all strings over {a,b}, such that$1)$Second symbol from $RHS$ should be $‘a’$$2)$Third symbol from $RHS$ should be $‘a�...
0 votes
0 votes
0 answers
3
VikramRB asked Jan 5, 2019
4,117 views
The Minimum DFA that accepts the given language is ____L = { w | w is any string not in a*b*}