Consider the following problems. denotes the language generated by a grammar . denotes the language accepted by a machine .
(I) For an unrestricted grammar and a string , whether
(II) Given a Turing machine , whether is regular
(III) Given two grammars and , whether
(IV) Given an NFA , whether there is a deterministic PDA such that and accept the same language.
Which one of the following statements is correct?
- AOnly I and II are undecidable
- BOnly III is undecidable
- COnly II and IV are undecidable
- DOnly I, II and III are undecidable

