LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
128
|
|
|
127
|
|
|
68
|
|
|
67
|
Detailed explanation-1: -If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ? Explanation: The maximum number of sets for DFA converted from NFA would be not greater than 2n.
Detailed explanation-2: -For an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is 2N. Q. Consider the following deterministic finite automata (DFA).
Detailed explanation-3: -Explanation: 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-4: -NFA with 5 states (left) whose DFA (right) requires 16 states.
Detailed explanation-5: -Statement 1: Initial State of NFA is Initial State of DFA. This statement is true because when converting an NFA to a DFA, the initial state of the DFA is the epsilon closure of the initial state of the NFA.