GATE CSE 2009 | Finite Automata and Regular Language Question 38 | Theory of Computation

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

Which one of the following languages over the alphabet $$\left\{ {0,\left. 1 \right)} \right.$$ is described by the regular expression $${\left( {0 + 1} \right)^ * }0{\left( {0 + 1} \right)^ * }0{\left( {0 + 1} \right)^ * }$$

The set of all strings containing the substring $$00$$

The set of all strings containing at most two $$0’$$s

The set of all strings containing at least two $$0’$$s

The set of all strings that begin and end with either $$0$$ or $$1$$

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

The regular expression $${0^ * }\left( {{{10}^ * }} \right){}^ * $$denotes the same set as

$$\left( {{1^ * }0} \right){}^ * {1^ * }$$

$$0 + \left( {0 + 10} \right){}^ * $$

$$\left( {0 + 1} \right){}^ * 10\left( {0 + 1} \right){}^ * $$

None of the above.

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Consider the set $$\sum {^ * } $$ of all strings over the alphabet $$\,\sum { = \,\,\,\left\{ {0,\,\,\,1} \right\}.\sum {^ * } } $$ with the concatenation operator for strings

Does not from a group

Forms a non-commutative group

Does not have a right identity element

Forms a group if the empty string is removed from $${\sum {^ * } }$$

GATE CSE 2001

MCQ (Single Correct Answer)

-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?

Only $${S_1}$$ is correct

Only $${S_2}$$ is correct

Both $${S_1}$$ and $${S_2}$$ are correct

None of $${S_1}$$ and $${S_2}$$ is correct

PREVIOUS NEXT