Which of the following is/are undecidable? 1. \(G\) is a CFG. Is \(L(G) =…

GATE · 2013 · CS · Computer Science & ITBARC · Computer Science · 2013

Which of the following is/are undecidable?

1. GG is a CFG. Is L(G)=ϕL(G) = \phi?

2. GG is a CFG. Is L(G)=∑∗L(G) = ∑^* ?

3. MM is a Turing machine. Is L(M)L(M) regular?

4. AA is a DFA and NN is an NFA. Is L(A)=L(N)L(A) = L(N)?

  1. A.

    3 only

  2. B.

    3 and 4 only

  3. C.

    1, 2 and 3 only

  4. D.

    2 and 3 only

Attempted by 260 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…