1
GATE CSE 2010
+2
-0.6
Let $$w$$ be any string of length $$n$$ in $${\left\{ {0,1} \right\}^ * }$$. Let $$L$$ be the set of all substrings of $$w.$$ What is the minimum number of states in a non-deterministic finite automation that accepts $$L$$?
A
$$n-1$$
B
$$n$$
C
$$n+1$$
D
$${2^{n + 1}}$$
2
GATE CSE 2009
+2
-0.6
$$L = {L_1} \cap {L_2}$$ where $${L_1}$$ and $${L_2}$$ are languages defined as follows.
$${L_1} = \left\{ {{a^m}{b^m}\,c\,{a^n}{b^n}\left| {m,n \ge 0} \right.} \right\}$$
$${L_2} = \left\{ {{a^i}{b^i}{c^k}\left| {i,j,k \ge 0} \right.} \right\}$$ Then $$L$$ is
A
Not recursive
B
Regular
C
Context free but not regular
D
Recursively enumerable but not context free
3
GATE CSE 2009
+2
-0.6

The above $$DFA$$ accepts the set of all strings over $$\left\{ {0,\,\,1} \right\}$$ that

A
Begin either with $$0$$ or $$1$$
B
End with $$0$$
C
End with $$00.$$
D
Contain the substring $$00.$$
4
GATE CSE 2008
+2
-0.6
Given below are two finite state automata ($$\to$$ indicates the start state and $$F$$ indicates a final state)

Which of the following represents the product automation $$ZY$$?

A
B
C
D
GATE CSE Subjects
EXAM MAP
Medical
NEET