Theory-of-Computation
December 6, 2023Theory-of-Computation
December 6, 2023GATE 1999
| Question 6 |
Let LD be the set of all languages accepted by a PDA by final state and LE the set of all languages accepted by empty stack. Which of the following is true?
| LD = LE | |
| LD ⊃ LE | |
| LE = LD | |
| None of the above |
Question 6 Explanation:
For any PDA which can be accepted by final state, there is an equivalent PDA which can also be accepted by an empty stack and for any PDA which can be accepted by an empty stack, there is an equivalent PDA which can be accepted by final state.
Correct Answer: A
Question 6 Explanation:
For any PDA which can be accepted by final state, there is an equivalent PDA which can also be accepted by an empty stack and for any PDA which can be accepted by an empty stack, there is an equivalent PDA which can be accepted by final state.