COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
From current state, on reading input symbol, it moves to more than one state
|
|
DFA
|
|
|
DFA with epsilon transitions
|
|
|
NFA
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -As per the definition of DFA, so as NFA it can have only one initial state.
Detailed explanation-2: -yes it may be NFA have more then number of states from minimized DFA.
Detailed explanation-3: -NFA with -moves. Nondeterministic finite automaton with -moves (NFA-) is a further generalization to NFA. In this kind of automaton, the transition function is additionally defined on the empty string .
Detailed explanation-4: -In NFA, each input symbol has zero or more transitions from any state. In DFA, however, each input symbol has precisely one transition from each state.
There is 1 question to complete.