Consider the following sets: S1. Set of all recursively enumerable languages…

PYQ GATE 2019

Consider the following sets:

S1. Set of all recursively enumerable languages over the alphabet {0,1}

S2. Set of all syntactically valid C programs

S3. Set of all languages over the alphabet {0,1}

S4. Set of all non-regular languages over the alphabet {0,1}

Which of the above sets are uncountable?

  1. A.

    S1 and S2

  2. B.

    S3 and S4

  3. C.

    S2 and S3

  4. D.

    S1 and S4

Attempted by 173 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…