COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
NFA
|
|
|
DFA
|
|
|
PDA
|
|
|
Both NFA and DFA
|
Detailed explanation-1: -In a nondeterministic finite automaton (NFA), for each state there can be zero, one, two, or more transitions corresponding to a particular symbol. If NFA gets to state with more than one possible transition corresponding to the input symbol, we say it branches.
Detailed explanation-2: -In DFA, there is only one path for specific input from the current state to the next state. DFA does not accept the null move, i.e., the DFA cannot change state without any input character. DFA can contain multiple final states.
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.
Detailed explanation-4: -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-5: -A DFA has exactly one transition from every state on every symbol in the alphabet.