1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?
A
$${L_D}\,\, = \,\,{L_E}$$
B
$${L_D}\,\, \supset \,\,{L_E}$$
C
$${L_D}\,\, \subset \,\,{L_E}$$
D
None of the above
2
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0.6
If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?
A
$${L_1} - {L_2}$$ is not context free
B
$${L_1} \cap {L_2}$$ is context free
C
$$ \sim {L_1}$$ is context free
D
$$ \sim {L_2}$$ is regular
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12