GATE CSE 2014 Set 2 | Recursively Enumerable Language and Turing Machine Question 12 | Theory of Computation

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.6

Let $$ < M > $$ be the encoding of a Turing machine as a string over $$\sum { = \left\{ {0,1} \right\}.} $$
Let $$L = \left\{ { < M > \left| M \right.} \right.$$ is a Turing machine that accepts a string of length $$\left. {2014} \right\}.$$ Then, $$L$$ is

decidable and recursively enumerable

un-decidable but recursively enumerable

un-decidable and not recursively enumerable

decidable but not recursively enumerable

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.6

Let $$L$$ be a language and $$\overline L $$ be its complement. Which one of the following is NOT a viable possibility?

Neither $$L$$ nor $$\overline L $$ is recursively enumerable (r.e).

One of $$L$$ and $$\overline L $$ is r.e. but not recursive; the other is not r.e.

Both $$L$$ and $$\overline L $$ are r.e. but not recursive.

Both $$L$$ and $$\overline L $$ are recursive.

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

If $$L$$ and $$\overline L $$ are recursively enumerable then $$L$$ is

Regular

Context-free

Context-sensitive

Recursive.

GATE CSE 2006

MCQ (Single Correct Answer)

-0.6

For $$s \in {\left( {0 + 1} \right)^ * },$$ let $$d(s)$$ denote the decimal value of $$s(e. g.d(101)=5)$$
Let $$L = \left\{ {s \in {{\left( {0 + 1} \right)}^ * }\left| {\,d\left( s \right)\,} \right.} \right.$$ mod $$5=2$$ and $$d(s)$$ mod $$\left. {7 \ne 4} \right\}$$

Which of the following statement is true?

$$L$$ is recursively enumerable, but not recursive

$$L$$ is recursive, but not context-free

$$L$$ is context-free, but not regular

$$L$$ is regular

PREVIOUS NEXT