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
$$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
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
3
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
All subjects of regular sets are regular.
4
GATE CSE 1990
True or False
+1
-0
State whether the following statement is TRUE / FALSE.
The intersection of two $$CFL's$$ is also $$CFL.$$
GATE CSE Subjects
Browse all chapters by subject
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages