The GATE Grind

GATE 2008 CS – Question 13

Theory of Computation · Turing Machines and Undecidability · 1 mark · Multiple choice

If L and $\bar L$ are recursively enumerable, L is

  1. regular
  2. context-free
  3. context-sensitive
  4. recursive

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) recursive

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Turing Machines and Undecidability questions

All Turing Machines and Undecidability questions →