GATE CSE 2005 | Finite Automata and Regular Language Question 72 | Theory of Computation

GATE CSE 2005

MCQ (Single Correct Answer)

-0.6

Consider the machine $$M:$$ The language recognized by $$M$$ is: GATE CSE 2005 Theory of Computation - Finite Automata and Regular Language Question 48 English

GATE CSE 2005 Theory of Computation - Finite Automata and Regular Language Question 48 English

$$\left\{ {w\,\, \in \,\left\{ {a,b} \right\}{}^ * \left| \, \right.} \right.$$ every $$a$$ in $$w$$ is followed by exactly two $$\left. {b's} \right\}$$

$$\left\{ {w\,\, \in \,\left\{ {a,b} \right\}{}^ * \left| \, \right.} \right.$$ every $$a$$ in $$w$$ is followed by at least two $$\left. {b's} \right\}$$

$$\left\{ {w\,\, \in \,\left\{ {a,b} \right\}{}^ * \left| \, \right.} \right.$$ $$w$$ contains the substring $$\,\left. {'abb'\,\,} \right\}\,$$

$$\left\{ {w\,\, \in \,\left\{ {a,b} \right\}{}^ * \left| \, \right.} \right.$$ $$w$$ does not contain $$'aa'$$ as a substring$$\left. \, \right\}$$

GATE CSE 2004

MCQ (Single Correct Answer)

-0.6

The following finite state machine accepts all those binary strings in which the number of $$1's$$ and $$0's$$ are respectively GATE CSE 2004 Theory of Computation - Finite Automata and Regular Language Question 47 English

GATE CSE 2004 Theory of Computation - Finite Automata and Regular Language Question 47 English

Divisible by $$3$$ and $$2$$

Odd and even

Even and odd

Divisible by $$2$$ and $$3$$

GATE CSE 2003

MCQ (Single Correct Answer)

-0.6

Consider the following deterministic finite state automation $$M.$$ GATE CSE 2003 Theory of Computation - Finite Automata and Regular Language Question 45 English

GATE CSE 2003 Theory of Computation - Finite Automata and Regular Language Question 45 English

Let $$S$$ denote the set of seven bit binary strings in which the first, the fourth, and the last bits are $$1$$. The number of strings in $$S$$ that are accepted by $$M$$ is

$$1$$

$$5$$

$$7$$

$$8$$

GATE CSE 2003

MCQ (Single Correct Answer)

-0.6

Consider the $$NFA$$ $$M$$ shown below. GATE CSE 2003 Theory of Computation - Finite Automata and Regular Language Question 46 English

Let the language accepted by $$M$$ be $$L.$$ Let $${L_1}$$ be the language accepted by the $$NFA$$, $${M_1}$$ obtained by changing the accepting state of $$M$$ to a non accepting state and by changing the non accepting state of $$M$$ to accepting states. Which of the following statements is true?

$${L_1} = \left\{ {0,\,1} \right\}{}^ * - L$$

$${L_1} = \left\{ {0,\,1} \right\}{}^ * $$

$${L_1} \subseteq \,L$$

$${L_1} = \,L$$

PREVIOUS NEXT