• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC-NET | NTA UGC NET 2019 June - II | Question 22

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


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments