1
GATE CSE 2000
+1
-0.3
Let $$S$$ and $$T$$ be languages over $$\sum { = \left\{ {a,b} \right\}}$$ represented by the regular expressions $${\left( {a + {b^ * }} \right)^ * }$$ and $$\,{\left( {a + b} \right)^ * },$$ respectively. Which of the following is true?
A
$$S \subset T$$
B
$$T \subset S$$
C
$$S=T$$
D
$$S \cap T = \phi$$
2
GATE CSE 2000
+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
3
GATE CSE 1999
+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
4
GATE CSE 1998
+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$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination