Computer Sciences > GATE 2014 SET-1 > Formal Languages
Let L be a language and L' be its complement. Which one of the following is NOT a viable possibility?
A
Neither L nor L' is recursively enumerable (r.e.).
B
One of L and L' is r.e. but not recursive; the other is not r.e.
C
Both L and L' are r.e. but not recursive.
D
Both L and L' are recursive.

Correct : c

Similar Questions

Let L1 be a regular language and L2 be a context-free language. Which of the following languages is/are context-free?
#1077 MSQ
For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110. Which of the following languages is/are context-free?
#1097 MSQ
Consider the alphabet Σ = {0, 1}, the null/empty string λ and the sets of strings X0, X1, and X2 generated by the corresponding non-terminals of a...
#1183 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: