Gate2018 cs Q13

0. The set of all recursively enumerable languages is

Answer
Comment
Array

Option : B
Explanation :
The Set of RE languages is closed under intersection, not closed under complementation, is not a subset of set of REC language, and is a countable set.

Forgot your password?

I agree with the Terms.