CSE GATE 2013 Question No 41 Theory of Computation - Context Free Grammars and Push-down Automata

Question No. 41 CSE | GATE 2013

Which of the following is/are undecidable?
1. G is a CFG. Is L(G) = Φ?
2. G is a CFG. Is L(G) = Σ*?
3. M is a Turing machine. Is L(M) regular?
4. A is a DFA and N is an NFA. Is L(A) = L(N)?

(A) 3 only
(B) 3 and 4 only
(C) 1, 2 and 3 only
(D) 2 and 3 only

Answer : (D) 2 and 3 only

GATE 2013 CSE Theory of Computation Context Free Grammars and Push-down Automata

Comments

7aMdbm http://pills2sale.com/ levitra nizagara

Posted on 18/10/2020 17:18:46 by dobsonz

QollgD http://xnxx.in.net/ xnxx videos

Posted on 12/12/2020 22:34:22 by johnan

B7uXxW https://writemyessayforme.web.fc2.com/

Posted on 13/12/2020 04:21:11 by dobson

ONRBlH https://writemyessayforme.web.fc2.com/#writemyessay

Posted on 15/12/2020 05:20:45 by dobson

eji8LX https://writemyessayforme.web.fc2.com/octavio-paz-essay-day-of-the-dead.html

Posted on 09/01/2021 11:13:35 by dobson

cqZrwq http://waldorfdollshop.us/ waldorf doll

Posted on 09/01/2021 15:31:02 by johnanz

GATE Papers >> CSE >> 2013 >> Question No 41

Answer : (D) 2 and 3 only

Questions of Context Free Grammars and Push-down Automata

About

Follow Us On

Contact Us

Search in Website