1
GATE CSE 2014 Set 1
+1
-0.3
Consider the finite automation in the following figure. What is the set of reachable states for the input string $$0011?$$

A
$$\left\{ {{q_0},\,{q_1},\,{q_2}} \right\}$$
B
$$\left\{ {{q_0},\,{q_1}} \right\}$$
C
$$\left\{ {{q_0},\,{q_1},\,{q_2},\,{q_3}} \right\}$$
D
$$\left\{ {{q_3}} \right\}$$
2
GATE CSE 2013
+1
-0.3
Consider the languages $${L_1} = \phi$$ and $${L_2} = \left\{ a \right\}.$$ Which one of the following represents $${L_1}\,L_2^ * UL_1^ * ?$$
A
$$\left\{ \varepsilon \right\}$$
B
$$\phi$$
C
$${a^ * }$$
D
$$\left\{ {\varepsilon ,a} \right\}$$
3
GATE CSE 2012
+1
-0.3
What is the complement of the language accepted by the $$NFA$$ shown below?
Assume $$\sum { = \left\{ a \right\}\,\,}$$ and $$\varepsilon$$ is the empty string. A
$$\phi$$
B
$$\left\{ \varepsilon \right\}$$
C
$$a{}^ *$$
D
$$\left\{ {a,\,\,\varepsilon } \right\}$$
4
GATE CSE 2010
+1
-0.3
Let $${L_1}$$ recursive language. Let $${L_2}$$ and $${L_3}$$ be languages that are recursively enumerable but not recursive. Which of the following statement is not necessarily true?
A
$${L_2}$$ $$-$$ $${L_1}$$ is recursively enumerable.
B
$${L_1}$$ $$-$$ $${L_3}$$ recursively enumerable.
C
$${L_2} \cap {L_1}$$ is recursively enumerable.
D
$${L_2} \cup {L_1}$$ is recursively enumerable.
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination