Complexity Theory UGC

Last Updated :
Discuss
Comments

Question 1

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​1​ and M2​ such that L(M) ⊆{L(M​1​)UL(M​2​)}= language of all TMs (c) M is a TM that accepts w using a most 2​|w|​ cells of tape
  • a and b only
  • a only
  • a, b and c
  • c only
Tags:

There are 1 questions to complete.

Take a part in the ongoing discussion