If L and L¯ are recursively enumerable, then L is

Related MCQs

• Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
• Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
• Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
• Recursively enumerable languages are not closed under
• Recursively enumerable languages are not closed under:
• Recursively enumerable languages are not closed under
• If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
• Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
• Given A = {0,1} and L = A*. If R = (0n1n, n > 0), then language L ∪ R and R are respectively
• If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?