If L and $\bar L$ are recursively enumerable then L is

Keep practicing — related questions

• If L and complement of L are both recursively enumerable, which of the following properties definately hold...
• Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which ...
• 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 L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
• Let L = L1 $\cap$ L2, where L1 and L2 are languages as defined below: L1 = $(a^m b^m\ ca^n b^m | m,n \ge 0)...
• If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, whi...
• If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, whi...