GATE CS 2014 Set 3 — Question 16

Multiple choice 1 mark Question 16 2014

Question 16

MCQ 1 marks · −0.33 Theory of Computation

Let \(L\) be a language and \(\bar{L}\) be its complement. Which one of the following is NOT a viable possibility?

A Neither \(L\) nor \(\bar{L}\) is recursively enumerable (r.e.) B One of \(L\) and \(\bar{L}\) is r.e. but not recursive; the other is not r.e. C Both \(L\) and \(\bar{L}\) are r.e. but not recursive D Both \(L\) and \(\bar{L}\) are recursive

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2014 Theory of Computation

Source: GATE 2014 Computer Science and Information Technology, Set 3, Q16 (question number approximate)

GATE CS 2021 Set 1 — Question 40
GATE CS 2017 Set 2 — Question 30
GATE CS 2019 — Question 37
GATE CS 2016 Set 1 — Question 19
GATE CS 2015 Set 3 — Question 33
GATE CS 2015 Set 1 — Question 23
GATE CS 2014 Set 2 — Question 35
GATE CS 2010 — Question 35

All Theory of Computation questions

The answer and the full explanation are one sign-in away

Where this question comes from

More questions from Theory of Computation