The set of all recursively enumerable languages is
- Aclosed under complementation.
- Bclosed under intersection.
- Ca subset of the set of all recursive languages.
- Dan uncountable set.
Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ1 mark · −1/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.