GATE CSE 2003 | Finite Automata and Regular Language Question 69 | Theory of Computation

PREVIOUS NEXT

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

GATE CSE 2001

MCQ (Single Correct Answer)

-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

$${N^2}$$

$${2^N}$$

$$2N$$

$$N!$$

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Let $$L$$ denote the language generated by the grammar $$S \to 0S\left. 0 \right|00.$$ Which one of the following is true?

$$L = {0^ + }$$

$$L$$ is regular but not $${0^ + }$$

$$L$$ is context free but not regular

$$L$$ is not context free