Let \(X\) be a recursive language and \(Y\) be a recursively enumerable but…

GATE · 2016 · CS · Set 1 · Computer Science & IT

1. A.

   $W$ can be recursively enumerable and $Z$  is recursive.

2. B.

   $W$ can be recursive and $Z$  is recursively enumerable.

3. C.

   $W$ is not recursively enumerable and $Z$  is recursive.

4. D.

   $W$ is not recursively enumerable and $Z$  is not recursive.

Attempted by 76 students.