COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
|
|
Q X
|
Detailed explanation-1: -The transition function is also called a next state function . Unlike DFAs an NFA moves into one of the states given by (q, a) if it receives the input symbol a while in state q. Which one of the states in (q, a) to select is determined nondeterministically. Note that is a function.
Detailed explanation-2: -The transition from a state is to a single particular next state for each input symbol. Hence it is called deterministic. 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-3: -2. What is the transitional function of a DFA? Explanation: Q is the finite set and let be a finite set of symbols so Q X fives no of states.
Detailed explanation-4: - : Transition Function, defined as : Q X –> Q. In a DFA, for a particular input character, the machine goes to one state only. A transition function is defined on every state for every input symbol. Also in DFA null (or ) move is not allowed, i.e., DFA cannot change state without any input character.