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. Given the following two statements :

S1: If L1 and L2 are recursively enumerable languages over Σ, then L1 ⋃ L2 and L1 ⌒ L2 are also recursively enumerable.

S2: The set of recursively enumerable languages is countable.

Which of the following is correct?
a. S1 is correct and S2 is not correct
b. S1 is not correct and S2 is correct
c. Both S1 and S2 are not correct
d. Both S1 and S2 are correct
Answer:Both S1 and S2 are correct
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: