1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as
A
Context free
B
Regular
C
Deterministic Context Free
D
Recursive
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statement is true?
A
If a language is context free it can always be accepted by deterministic pushdown automation
B
The union of two context free language is context free
C
The intersection of two context free languages is context free
D
The complement of a context free language is context free
3
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
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Context free languages are closed under:
A
Union, intersection
B
Union, Kleene closure
C
Intersection, complement
D
Complement, Kleene Closure
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12