📚 Question Bank Q45 — Theory of Computation
⚙Tags
Home › UGC NET Paper 2: Computer Science 8th Oct 2022 › Theory of Computation
Theory of Computation
Q45. Marks: +2.0 UGC NET Paper 2: Computer Science 8th Oct 2022

Consider the properties of recursively enumerable sets:

(A) Finiteness

(B) Context Freedom

(C) Emptiness

Which of the following is true?

1.Only (A) and (B) are not decidable
2.Only (B) and (C) are not decidable
3.Only (C) and (A) are not decidable
4.All (A), (B) and (C) are not decidable ✓ Correct
📄 All “Theory of Computation” questions across papers
7 / 10 in this subject • Back to paper
🏷 Change Tag for this Question ▶