THEORY OF COMPUTATION TOC GATE CS PYQ 2018

GATE CS 2018
THEORY OF COMPUTATION PYQ
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∈L(G)
(II) Given a Turing machine M, whether L(M) is regular
(III) Given two grammar G1 and G2, whether L(G1) = L(G2)
(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 statement is correct?
(A) Only I and II are undecidable
(B) Only II is undecidable
(C) Only II and IV are undecidable
(D) Only I, II and III are undecidable