GATE Computer Science (CS) 2011 Solved Paper

Question : 18 of 65

Marks: +1, -0

Which of the following pairs have DIFFERENT expressive power?

Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)
Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)
Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine
Single-tape Turing machine and multi-tape Turing machine

Go to Question:

Prev Question

Next Question