COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
true
|
|
|
false
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -Statement: The operations of PDA never work on elements, other than the top. Explanation: The term pushdown refers to the fact that the elements are pushed down in the stack and as per the LIFO principle, the operation is always performed on the top element of the stack.
Detailed explanation-2: -True, Pushdown Automata is a finite automaton with extra memory called stack which helps Pushdown automata to recognize Context-Free Languages.
Detailed explanation-3: -A pushdown automaton (PDA) is a finite automaton with a stack that has stack operations pop, push, and nop. PDAs always start with one designated symbol on the stack. A state transition depends on the input symbol and the top of the stack. The machine then performs a stack operation and enters the next state.
Detailed explanation-4: -Explanation: A Deterministic Push Down Automata is a Push Down Automata in which no state p has two or more transitions.
Detailed explanation-5: -Explanation: All regular languages can be accepted by a non deterministic finite automata and all context free languages can be accepted by a non deterministic push down automata.