The set of all recursively enumerable languages is

PYQ GATE 2018

The set of all recursively enumerable languages is

  1. A.

    closed under complementation.

  2. B.

    closed under intersection.

  3. C.

    a subset of the set of all recursive languages.

  4. D.

    an uncountable set.

Attempted by 304 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…