COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Present state
|
|
|
Input Symbol
|
|
|
Both (a) and (b)
|
|
|
None of the mentioned
|
Detailed explanation-1: -Answers. The next operation is performed by PDA considering three factors: present state, symbol on the top of the stack and the input symbol.
Detailed explanation-2: -8. Which of the operations are eligible in PDA? Explanation: Push and pop are the operations we perform to operate a stack. A stack follows the LIFO principle, which states its rule as: Last In First Out.
Detailed explanation-3: -Usually denotes the stack alphabet.-In case of a pushdown automaton, the transition function depends on, (i) the current state, (ii) the currently read input symbol (can be ), and (iii) the currently read stack symbol at the top of the stack (again it can be ).
Detailed explanation-4: -Which of the following correctly recognize the symbol ‘|-’ in context to PDA? a) Moves b) transition function c) or/not symbol d) none of the mentioned Answer: a Explanation: Using this notation, we can define moves and further acceptance of a string by the machine.