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 1995
MCQ (Single Correct Answer)
+1
-0.3
Consider the grammar with the following productions.
$$S \to a\,\alpha \,\,b\left| {\,\,b\,\alpha } \right.\,c\,\left| {aB} \right.$$
$$S \to \alpha S\,\left| b \right.$$
$$S \to \alpha \,bb\,\left| {ab} \right.$$
$$S\alpha \to bdb\,\left| b \right.$$
the above grammar is
A
Context free grammar
B
Regular grammar
C
Context sensitive grammar
D
$$LR(k)$$
3
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

All subjects of regular sets are regular.

A
TRUE
B
FALSE
4
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

A minimal $$DFA$$ that is equivalent to an $$NFDA$$ with $$n$$ modes has always 2n states

A
TRUE
B
FALSE
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12