Regarding the power of recognition of languages, which of the following statements is false?
The 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.
Non-deterministic Turing machines are equivalent to deterministic Turing machines.
Multi-tape Turing machines are available are equivalent to Single-tape Turing machines.
Answer: This question has multiple answers, B and C.