GATE | CS | 2019 | Aptitude | Spatial Aptitude | Question 43 (original) (raw)

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?

Share your thoughts in the comments