Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 6
  • Last Updated : 06 Oct, 2017

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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :