GATE CSE 2014 Set 1 | GATE CSE Year Wise Previous Years Questions

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 68 English

GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 68 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.6

Which of the regular expression given below represent the following $$DFA?$$ GATE CSE 2014 Set 1 Theory of Computation - Finite Automata and Regular Language Question 33 English 1

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

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

$${\rm I}$$ and $${\rm II}$$ only

$${\rm I}$$ and $${\rm III}$$ only

$${\rm II}$$ and $${\rm III}$$ only

$${\rm I}$$, $${\rm II}$$ and $${\rm III}$$

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.6

Let $$L$$ be a language and $$\overline L $$ be its complement. Which one of the following is NOT a viable possibility?

Neither $$L$$ nor $$\overline L $$ is recursively enumerable (r.e).

One of $$L$$ and $$\overline L $$ is r.e. but not recursive; the other is not r.e.

Both $$L$$ and $$\overline L $$ are r.e. but not recursive.

Both $$L$$ and $$\overline L $$ are recursive.

GATE CSE Papers

2023