Question 10026 – Theory-of-Computation
December 6, 2023Question 9906 – Theory-of-Computation
December 6, 2023Question 9883 – Theory-of-Computation
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?
Correct Answer: A
Question 37 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.
LD = LE
LD ⊃ LE
LE = LD
None of the above
Subscribe
Login
0 Comments