1
GATE CSE 2003
+1
-0.3
Consider the set $$\sum {^ * }$$ of all strings over the alphabet $$\,\sum { = \,\,\,\left\{ {0,\,\,\,1} \right\}.\sum {^ * } }$$ with the concatenation operator for strings
A
Does not from a group
B
Forms a non-commutative group
C
Does not have a right identity element
D
Forms a group if the empty string is removed from $${\sum {^ * } }$$
2
GATE CSE 2001
+1
-0.3
Consider the following two statements;
$${S_1}\,\,:\,\,\left\{ {{0^{2n}}\left| {n \ge 1} \right.} \right\}$$ is a regular language
$${S_2}\,\,:\,\,\left\{ {{0^m}{1^n}{0^{m + n}}\left| {m \ge 1} \right.\,\,and\,\,n \ge \left. 1 \right\}} \right.$$ is a regular language

Which of the following statements is correct?

A
Only $${S_1}$$ is correct
B
Only $${S_2}$$ is correct
C
Both $${S_1}$$ and $${S_2}$$ are correct
D
None of $${S_1}$$ and $${S_2}$$ is correct
3
GATE CSE 2001
+1
-0.3
Given an arbitrary non-deterministic finite automaton $$(NFA)$$ with $$N$$ states, the maximum number of states in an equivalent minimized $$DFA$$ is at least
A
$${N^2}$$
B
$${2^N}$$
C
$$2N$$
D
$$N!$$
4
GATE CSE 2000
+1
-0.3
Let $$S$$ and $$T$$ be languages over $$\sum { = \left\{ {a,b} \right\}}$$ represented by the regular expressions $${\left( {a + {b^ * }} \right)^ * }$$ and $$\,{\left( {a + b} \right)^ * },$$ respectively. Which of the following is true?
A
$$S \subset T$$
B
$$T \subset S$$
C
$$S=T$$
D
$$S \cap T = \phi$$
GATE CSE Subjects
EXAM MAP
Medical
NEET