COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
n+1
|
|
|
n
|
|
|
n-1
|
|
|
n+2
|
Detailed explanation-1: -Answers. The maximum number of final states for a DFA can be total number of states itself and minimum would always be 1, as no DFA exits without a final state. Therefore, the solution is n+1.
Detailed explanation-2: -∴ Minimum number of states required for DFA = 3.
Detailed explanation-3: -For an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is 2N.
Detailed explanation-4: -A state in a DFA will be a subset of the set of states of the equivalent NFA. So, the maximum number of states in the equivalent DFA of an NFA, will be 2n, where n is the number of states in NFA, as a set with n items has maximum 2n subsets. GATE CS Answer Key has been released!
Detailed explanation-5: -Take for example : An NFA has 7 states out of which 3 are final states. Its equivalent DFA can have atmost 128 states.