1
GATE CSE 2003
+2
-0.6
Consider the $$NFA$$ $$M$$ shown below.

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?

A
$${L_1} = \left\{ {0,\,1} \right\}{}^ * - L$$
B
$${L_1} = \left\{ {0,\,1} \right\}{}^ *$$
C
$${L_1} \subseteq \,L$$
D
$${L_1} = \,L$$
2
GATE CSE 2003
+2
-0.6
Consider the following deterministic finite state automation $$M.$$

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

A
$$1$$
B
$$5$$
C
$$7$$
D
$$8$$
3
GATE CSE 2002
+2
-0.6
The smallest finite automaton which accepts the language
$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has
A
$$2$$ states
B
$$3$$ states
C
$$4$$ states
D
$$5$$ states
4
GATE CSE 2002
+2
-0.6
The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$x/y$$ and $$x$$ stands for $$1-bit$$ input and $$y$$ stands for $$2$$-bit output
A
Outputs the sum of the present and the previous bits of the input.
B
Outputs $$01$$ whenever the input sequence contains $$11$$
C
Outputs $$00$$ whenever the input sequence contains $$10$$
D
None of the above
GATE CSE Subjects
EXAM MAP
Medical
NEET