Regarding power of recognition of language, which of the following statements is false?
- Non deterministic finite-state automata are equivalent to deterministic finite-state automata.
- Non-deterministic push-down automata are equivalent to deterministic push-down automata.
- Non-deterministic Turing Machines are equivalent to deterministic push-down automata.
- Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.