1
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the finite automation in the following figure. GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 90 English

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 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
If $${L_1} = \left\{ {{a^n}\left| {n \ge \left. 0 \right\}} \right.} \right.$$ and $${L_2} = \left\{ {{b^n}\left| {n \ge \left. 0 \right\}} \right.} \right.,$$ consider
$$\left. {\rm I} \right)$$ $$\,\,\,{L_{1 \bullet }}{L_2}$$ is a regular language
$$\left. {\rm II} \right)$$ $$\,\,\,{L_{1 \bullet }}{L_2} = \left\{ {{a^n}{b^n}\left| {n \ge \left. 0 \right\}} \right.} \right.$$
Which one of the following is CORRECT?
A
Only $$\left( {\rm I} \right)$$
B
Only $$\left( {\rm II} \right)$$
C
Both $$\left( {\rm I} \right)$$ and $$\left( {\rm II} \right)$$
D
Neither $$\left( {\rm I} \right)$$ nor $$\left( {\rm II} \right)$$
3
GATE CSE 2013
MCQ (Single Correct Answer)
+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\}$$
4
GATE CSE 2012
MCQ (Single Correct Answer)
+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. GATE CSE 2012 Theory of Computation - Finite Automata and Regular Language Question 93 English
A
$$\phi $$
B
$$\left\{ \varepsilon \right\}$$
C
$$a{}^ * $$
D
$$\left\{ {a,\,\,\varepsilon } \right\}$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP