Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following pairs have DIFFERENT expressive power?
1
Deterministic finite automata (DFA) and Non-deterministic finite automata (NFA)
2
Deterministic push down automata (DPDA) and Non-deterministic push down automata (NPDA)
3
Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine
4
Single-tape Turing machine and multi-tape Turing machine
5
Question Not Attempted