Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which machine is equally powerful in both deterministic and non-deterministic form?
1
Push Down Automata
2
Turing machine
3
Linear Bounded Automata
4
None of the options