GATE CS 2012 — Question 27

Multiple choice 2 marks Question 27 2012

Question 27

MCQ 2 marks · −0.66 Theory of Computation

Which of the following problems are decidable?

  1. Does a given program ever produce an output?
  2. If \(L\) is a context-free language, then is \(\bar{L}\) also context-free?
  3. If \(L\) is a regular language, then is \(\bar{L}\) also regular?
  4. If \(L\) is a recursive language, then is \(\bar{L}\) also recursive?

Answers and explanations are free — they just need an account.

Where this question comes from

Source: GATE 2012 Computer Science and Engineering, Q27 (question number approximate)