1
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
Let $$L$$ denote the language generated by the grammar $$S \to 0S\left. 0 \right|00.$$ Which one of the following is true?
A
$$L = {0^ + }$$
B
$$L$$ is regular but not $${0^ + }$$
C
$$L$$ is context free but not regular
D
$$L$$ is not context free
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:
A
$$n$$ states
B
$$n+1$$ states
C
$$n+2$$ states
D
None of the above
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
If the regular set $$A$$ is represented by $$A = {\left( {01 + 1} \right)^ * }$$ and the regular set $$'B'$$ is represented by $$B = \left( {{{\left( {01} \right)}^ * }{1^ * }} \right),$$ which of the following is true?
A
$$A \subset B$$
B
$$B \subset A$$
C
$$A$$ and $$B$$ are incomparable
D
$$A=B$$
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following sets can be recognized by a Deterministic Finite-state Automation?
A
The numbers $$1, 2, 4, 8, $$ ...... $${2^n},$$ ............. written in binary.
B
The numbers $$1, 2, 4, ..... $$ $${2^n},$$ $$.....$$ written in unary.
C
The set of binary strings in which the numbers of zeros is the same as the numbers of ones.
D
The set $$\left\{ {1,101,11011,1110111,...} \right\}.$$
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