1
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
A single tape Turing Machine $$M$$ has two states $${q_0}$$ and $${q_1}$$, of which $${q_0}$$ is the starting state. The tape alphabet of $$M$$ is $$\left\{ {0,\,\,1,\,\,B} \right\}$$ and its input alphabet is $$\left\{ {0,\,\,1} \right\}$$. The symbol $$B$$ is the blank symbol used to indicate end of an input string. The transition function of $$M$$ is described in the following table. GATE CSE 2003 Theory of Computation - Recursively Enumerable Language and Turing Machine Question 21 English

The table is interpreted as illustrated below. The entry $$\left( {{q_1},1,\,R} \right)$$ in row $${{q_0}}$$ and column $$1$$ signifies that if $$M$$ is in state $${{q_0}}$$ and reads $$1$$ on the current tape square, then it writes $$1$$ on the same tape square, moves its tape head one position to the right and transitions to state $${{q_1}}$$.

Which of the following statements is true about $$M?$$

A
$$M$$ does not halt on any string in $${\left( {0 + 1} \right)^ + }$$
B
$$M$$ does not halt on any string in $${\left( {00 + 1} \right)^ + }$$
C
$$M$$ halts on all string ending in a $$0$$
D
$$M$$ halts on all string ending in $$a$$
2
GATE CSE 2003
MCQ (Single Correct Answer)
+2
-0.6
Define Languages $${L_0}$$ and $${L_1}$$ as follows
$${L_0} = \left\{ { < M,\,w,\,0 > \left| {M\,\,} \right.} \right.$$ halts on $$\left. w \right\}$$
$${L_1} = \left\{ { < M,w,1 > \left| M \right.} \right.$$ does not halts on $$\left. w \right\}$$

Here $$ < M,\,w,\,i > $$ is a triplet, whose first component, $$M$$ is an encoding of a Turing Machine, second component, $$w$$, is a string, and third component, $$t,$$ is a bit.
Let $$L = {L_0} \cup {L_1}.$$ Which of the following is true?

A
$$L$$ is recursively enumerable, but $$\overline L $$ is not
B
$$\overline L $$ is recursively enumerable, but $$L$$ is not
C
Both $$L$$ and $$\overline L $$ are recursive
D
Neither $$L$$ nor $$\overline L $$ is recursive enumerable
3
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is true?
A
The complement of a recursively language is recursive.
B
The complement of a recursively enumerable language is recursively enumerable.
C
The complement of a recursively language is either recursive or recursively enumerable.
D
The complement of a context-free language is context-free.
4
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The $$C$$ language is:
A
A context free language
B
A context sensitive language
C
A regular language
D
Parsable fully only by a Turing machine
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12