GATE CSE · 2019 · CS
Question 34: Theory of Computation
Give it a try, then reveal the answer to check your work.
Question 34
CSMCQ2 marksNeeds review
Consider the following sets:
S1. Set of all recursively enumerable languages over the alphabet
S2. Set of all syntactically valid C programs
S3. Set of all languages over the alphabet
S4. Set of all non-regular languages over the alphabet
Which of the above sets are uncountable?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2019CS
GATE CSE 2019 · Paper 1
Computer Science and Information Technology · Original paper archive
- Section
- Computer Science and Information Technology
- Question type
- Multiple choice (MCQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
theory computation
GATE CSE previous year questions
Theory of Computation
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.