UGC NET PAPER 2 June 2019 Question 79 (Shift-I)

79. Which of the following problems is/are decidable problem(s) (recursively enumerable) on a Turing machine M?
(a) G is a CFG with L(G)=∅
(b) There exist two TMs M ₁ and M₂ such that L(M) ⊆ {L(M₁)UL(M₂)}= language of all TMs
(c) M is a TM that accepts w using a most 2^|w| cells of tape

A (a) and (b) only

B (a) only

C (a), (b) and (c)

D (c) only

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 78	UGC NET CS 2018 July - II Question 80