If L and complement of L are both recursively enumerable, which of the following properties definately holds for L?

Keep practicing — related questions

• If L and $\bar L$ are recursively enumerable then L is
• If L and $\bar L$ are recursively enumerable then L is
• Which of the following is true?
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
• Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
• Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursiv...
• Consider the following languages: L1 = {0p 1 q0r | p, q, r $\ge$ 0} L2 = {0p1q0r | p, p, r $\ge$ 0, p $\ne$...
• Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which ...