1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statement is false?
A
Every $$NFA$$ can be converted to an equivalent $$DFA$$
B
Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine.
C
Every regular language is also a context- free language
D
Every subset of a recursively enumerable set is recursive
2
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the $$CFG$$ with $$\left\{ {S,A,B} \right\}$$ as the non-terminal alphabet, $$\left\{ {a,b} \right\}$$ as the terminal alphabet, $$S$$ as the start symbol and the following set of production rules: GATE CSE 2007 Theory of Computation - Push Down Automata and Context Free Language Question 36 English

For the correct string of (earlier question) how many derivation trees are there?

A
$$1$$
B
$$2$$
C
$$3$$
D
$$4$$
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
The language $$L = \left\{ {{0^i}{{21}^i}\,|\,i \ge 0} \right\}$$ over the alphabet $$\left\{ {0,1,2} \right\}$$ is
A
Not recursive.
B
is recursive and is a deterministic $$CFL$$.
C
is a regular language.
D
is not a deterministic $$CFL$$ but a $$CFL$$.
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the $$CFG$$ with $$\left\{ {S,A,B} \right\}$$ as the non-terminal alphabet, $$\left\{ {a,b} \right\}$$ as the terminal alphabet, $$S$$ as the start symbol and the following set of production rules: GATE CSE 2007 Theory of Computation - Push Down Automata and Context Free Language Question 37 English

Which of the following strings is generated by the grammar?

A
$$aaaabb$$
B
$$aabbbb$$
C
$$aabbab$$
D
$$abbbba$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP