COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which automata has at most one transition from each state to any input?
|
|
NFA
|
|
|
DFA
|
|
|
Both NFA and DFA
|
|
|
None of the mentioned
|
Explanation:
Detailed explanation-1: -A DFA has exactly one transition from every state on every symbol in the alphabet.
Detailed explanation-2: -The deterministic finite automaton or DFA is a very simple machine. It has one read-only input tape, with the restriction that the tape head can only move from left to right and can never change direction.
Detailed explanation-3: -Deterministic finite state automata (NFA) can only have one enabled transition at a time while a non-deterministic finite state automata (DFA) can have multiple.
There is 1 question to complete.