Q36

MCQ2 marks, −0.67

Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$ . L(M) denotes the language accepted by a machine $M$ . Which one of the following statement is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable

(A)

For an unrestricted grammar $G$ and a string $w$ , whether $w \in L(G)$

(B)

Given a Turing machine $M$ , whether $L(M)$ is regular

(C)

Given two grammar $G_1$ and $G_2$ , whether $L(G_1) = L(G_2)$

(D)

Given an NFA $N$ , whether there is a deterministic PDA $P$ such that $N$ and $P$ accept the same language

Loading…