Consider the following sets: S1. Set of all recursively enumerable languages…
GATE · 2019 · CS · Computer Science & IT
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?
- A.
S1 and S2
- B.
S3 and S4
- C.
S2 and S3
- D.
S1 and S4
Attempted by 155 students.
Sign up free to check your answer
Sign up freeLoading lesson…