COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
DFA has Null( Empty )Transitions
|
|
YES
|
|
|
NO
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -DFA vs NDFA The transition from a state can be to multiple next states for each input symbol. Hence it is called non-deterministic. Empty string transitions are not seen in DFA.
Detailed explanation-2: -A deterministic finite automata does not need a transition from every state for every symbol. The meaning when (q, a) does not exist is simply that the DFA does not accept the input string.
Detailed explanation-3: -DFA does not accept the null move, i.e., the DFA cannot change state without any input character. DFA can contain multiple final states. It is used in Lexical Analysis in Compiler.
Detailed explanation-4: -A DFA has exactly one transition from every state on every symbol in the alphabet.
There is 1 question to complete.