GATE CSE 2015 Set 3 | Finite Automata and Regular Language Question 42 | Theory of Computation

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

-0.3

Let $$L$$ be the language represented by the regular expression $$\sum {^ * 0011\sum {^ * } } $$ where $$\sum { = \left\{ {0,1} \right\}} .$$ What is the minimum number of states in a $$DFA$$ that recognizes $$\overline L $$ (complement of $$L$$)?

$$4$$

$$5$$

$$6$$

$$8$$

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-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?

Only $$\left( {\rm I} \right)$$

Only $$\left( {\rm II} \right)$$

Both $$\left( {\rm I} \right)$$ and $$\left( {\rm II} \right)$$

Neither $$\left( {\rm I} \right)$$ nor $$\left( {\rm II} \right)$$

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Consider the finite automation in the following figure. GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 94 English

GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 94 English

What is the set of reachable states for the input string $$0011?$$

$$\left\{ {{q_0},\,{q_1},\,{q_2}} \right\}$$

$$\left\{ {{q_0},\,{q_1}} \right\}$$

$$\left\{ {{q_0},\,{q_1},\,{q_2},\,{q_3}} \right\}$$

$$\left\{ {{q_3}} \right\}$$

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is TRUE?

The language $$L = \left\{ {{a^n}\,{b^n}\left| {n \ge 0} \right.} \right\}$$ is regular.

The language $$L = \,\,\left\{ {{a^n}\,\left| n \right.\,} \right.$$ is prime$$\left. \, \right\}$$ is regular.

The language $$L = \left\{ {w\left| {w\,\,} \right.} \right.$$ has $$3k+1$$ $$b'$$ $$s$$ for some $$k \in N$$ with $$\sum { = \left\{ {a,\,\,b} \right\}\left. \, \right\}} $$ is regular.

The language $$L = \left\{ {ww\,\left| {w \in \sum {{}^ * } } \right.} \right.$$ with $$\sum { = \left. {\left\{ {0,\,\,1} \right\}} \right\}} $$ is regular.

PREVIOUS NEXT