Let LD be the set of all language accepted by a PDA by final state and LE the set of all languages accepted by empty stack.
Which of the following is true?
A
LD⊂LE
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
LD⊃LE
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
None of the above
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
LD = LE
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution
The correct option is DLD = LE There are two approaches by which PDA accepts its input
(a) Acceptance by empty stack
(b) Accepting by entering final state.
Since there exist algorithm to convert PDA accepting by final state to PDA accepting by empty stack and vice-versa,the acceptance or recognition power of PDA of both approaches are same.Therefore LD = LE