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

Correct Answer is : Both L and L→ are r.e. but not recursive.

Neither L nor L^{\to} is recursively enumerable (r.e.).

One of L and L^{\to} is r.e. but not recursive; the other is not r.e.

Both L and L^{\to} are r.e. but not recursive.

Both L and L^{\to} are recursive.

GATE Computer Science (CS) 2014 Shift 1 Solved Paper

Question : 45 of 65

Marks: +1, -0

Let L be a language and

L↖{→}

be its complement. Which one of the following is NOT a viable possibility?

Go to Question:

Prev Question

Next Question