1
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)$$
2
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
3
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.

Regularity is preserved under the operation of string reversal.

A
TRUE
B
FALSE
4
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
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSAT
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN