TOC | Decidability & Undecidability | CS GATE PYQs | GATE 2018 Solutions|SolutionsAdda| Q11|GATE2022

GATE 2018 Q: 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?

GATE Previous Year Questions with detailed explanation question by question
Website: https://solutionsadda.in/
GATE PYQs : https://solutionsadda.in/gate1/
ISRO / DRDO PYQs: https://solutionsadda.in/isro/
NIC - NIELIT PYQs: https://solutionsadda.in/nielit/

GATE Complete Analysis: https://solutionsadda.in/gate-complet...
ISRO Complete Analysis: https://solutionsadda.in/isro-complet...
NIC-NIELIT Complete Analysis: https://solutionsadda.in/nielit/

For GATE, BARC, ISRO, CIL, AAI, HAL, UGC NET JRF, NIC NIELIT, STQC NIELIT, NVS, KVS, DSSSB PGT/TGT
Test series : https://solutionsadda.in/test-series/ && http://new.solutionsadda.in/index.php...

If you have any queries write a mail: [email protected]
Face Book Page:   / solutionsaddain-111628724482494  
Telegram: https://t.me/solutionsaddaforcse