GATE | GATE CS 1999 | Question 6

Let L be the set of all languages accepted by a PDA by final state and L the set of all languages accepted by empty stack. Which of the following is true?
q2
(A) a
(B) b
(C) c
(D) d


Answer: (A)

Explanation:

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.