GATE CS 2018 (Forenoon) — Question 46

Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ2 marks · −2/3 if wrongMedium

Consider the following problems. \(L(G)\) denotes the language generated by a grammar \(G\). \(L(M)\) denotes the language accepted by a machine \(M\). (I) For an unrestricted grammar \(G\) and a string \(w\), whether \(w \in L(G)\) (II) Given a Turing machine \(M\), whether \(L(M)\) is regular (III) Given two grammars \(G_1\) and \(G_2\), whether \(L(G_1) = L(G_2)\) (IV) Given an NFA \(N\), whether there is a deterministic PDA \(P\) such that \(N\) and \(P\) accept the same language. Which one of the following statements is correct?
  1. A
    Only I and II are undecidable
  2. B
    Only III is undecidable
  3. C
    Only II and IV are undecidable
  4. D
    Only I, II and III are undecidable
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Turing Machines & UndecidabilityTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group