GATE 2014 [Set-1]
April 3, 2025GATE 2014 [Set-1]
April 3, 2025GATE 2014 [Set-1]
|
Question 45
|
Let L be a language and L’ be its complement. Which one of the following is NOT a viable possibility?
|
Neither L nor
is recursively enumerable (r.e.). |
|
|
One of L and
is r.e. but not recursive; the other is not r.e. |
|
|
Both L and
are r.e. but not recursive. |
|
|
Both L and
are recursive. |
Question 45 Explanation:
If both L and L’ are recursively enumerable, then L must be recursive. Hence, both L and L´ are recursively enumerable, but not recursive is not a viable possibility.
Correct Answer: C
Question 45 Explanation:
If both L and L’ are recursively enumerable, then L must be recursive. Hence, both L and L´ are recursively enumerable, but not recursive is not a viable possibility.
![GATE 2014 [Set-1]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png)
is recursively enumerable (r.e.).