A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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 statements are true ?
a. I only
b. I and II
c. I and III
d. II and III
Answer:I and II
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: