TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
NFA
|
|
|
DFA
|
|
|
Both NFA and DFA
|
|
|
None of the mentioned
|
Detailed explanation-1: -The finite automata are called deterministic finite automata if the machine is read an input string one symbol at a time. 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.
Detailed explanation-2: -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-3: -DFAs are often represented by digraphs called (state) transition diagram. The vertices (denoted by single circles) of a transition diagram represent the states of the DFA and the arcs labeled with an input symbol correspond to the transitions.