Gate CS-2011 Question Paper With Solutions

Q. 8 Which of the following pairs have DIFFERENT expressive power?

(A) Deterministic finite automata (DFA) and Non-deterministic finite automata
(NFA)

(B) Deterministic push down automata (DPDA) and Non-deterministic push
down automata (NPDA)

(C) Deterministic signle-tape turing machine and Non-deterministic single-tape
Turing machine

(D) Single-tape Turing machine and multi-tape Turing machine

Answer: (B)

Explanation:

Gate CS-2011 Question Paper With Solutions

Learn More:   Gate EC-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here