GATE CSE 2018

Planning to take coaching on Unacademy http://bit.ly/gate_unacademy or https://unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- https://t.me/joinchat/X5egW_cvdt9kMGY1 Telegram discussion Group link:- https://t.me/joinchat/VCyGUmVq8RNkMzhl Downloads resources from here https://education4fun.com/gate-cse/ MCQ (Single Correct Answer) GATE CSE 2018 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