Q1.11

MCQMarks unknown

Regarding the power of recognition of languages, which of the following statements is false?

(A)

The non-deterministic finite-state automata are equivalent to deterministic finite-state automata.

(B)

Non-deterministic Push-down automata are equivalent to deterministic Push-down automata.

(C)

Non-deterministic Turing machines are equivalent to deterministic Turing machines.

(D)

Multi-tape Turing machines are available are equivalent to Single-tape Turing machines.

Loading…