Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?

Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements? Correct Answer II only

Recursive languages are closed under the following operations. The Kleene star L * of L The concatenation L * o P of L and P The union L U P The intersection L ∩ P.
Bissoy MCQ

Related Questions

Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?
The mixing vat in a factory receives liquid ingredients through six separate value--- labeled R.S.T.U,Y and Z -- each of which has exactly two settings: open and closed.The mixing vat operator must ensure that each valve is set open or closed according to the following conditions: If T is open, both S and Z must be closed, R and Z cannot both be closed at the same time; If Y is closed, Z must also be closed;S and U cannot both be open at the same time. If the maximum number of valves that can be closed at the same time are closed which of the following must true?
Choose the correct option: Statement: If L1 and L2 are recursively enumerable languages over S, then the following is/are recursively enumerable.
The mixing vat in a factory receives liquid ingredients through six separate value--- labeled R.S.T.U,Y and Z -- each of which has exactly two settings: open and closed.The mixing vat operator must ensure that each valve is set open or closed according to the following conditions: If T is open, both S and Z must be closed, R and Z cannot both be closed at the same time; If Y is closed, Z must also be closed;S and U cannot both be open at the same time. If R is closed and U is open, which of the following must be true?
The mixing vat in a factory receives liquid ingredients through six separate value--- labeled R.S.T.U,Y and Z -- each of which has exactly two settings: open and closed.The mixing vat operator must ensure that each valve is set open or closed according to the following conditions: If T is open, both S and Z must be closed, R and Z cannot both be closed at the same time; If Y is closed, Z must also be closed;S and U cannot both be open at the same time. Which of the following, if given to the mixing vat operator as an instruction, would not determine the setting of any other valve ?
The mixing vat in a factory receives liquid ingredients through six separate value--- labeled R.S.T.U,Y and Z -- each of which has exactly two settings: open and closed.The mixing vat operator must ensure that each valve is set open or closed according to the following conditions: If T is open, both S and Z must be closed, R and Z cannot both be closed at the same time; If Y is closed, Z must also be closed;S and U cannot both be open at the same time. If Z is open, which of the following must be true?
Which of the following technique is used to find whether a natural language isn’t recursive enumerable?
L and ~L are recursive enumerable then L is?
L and ~L are recursive enumerable then L is
A recursively enumerable language L can be recursive if: