The set of all recursively enumerable languages is
PYQ GATE 2018
The set of all recursively enumerable languages is
- A.
closed under complementation.
- B.
closed under intersection.
- C.
a subset of the set of all recursive languages.
- D.
an uncountable set.
Attempted by 304 students.
Sign up free to check your answer
Sign up freeLoading lesson…

