Given the following two statements: 𝑆1: If 𝐿1 and 𝐿2 are recursively…
PYQ UGC NET 2015
Given the following two statements:
𝑆1: If 𝐿1 and 𝐿2 are recursively enumerable languages over Σ, then 𝐿1 ∪ 𝐿2 and 𝐿1 ∩ 𝐿2 are also recursively enumerable.
𝑆2: The set of recursively enumerable languages is countable.
Which of the following is correct ?
- A.
𝑆1 is correct and 𝑆2 is not correct
- B.
𝑆1 is not correct and 𝑆2 is correct
- C.
Both 𝑆1 and 𝑆2 are not correct
- D.
Both 𝑆1 and 𝑆2 are correct
Attempted by 91 students.
Sign up free to check your answer
Sign up freeLoading lesson…

