Skip to content
Related Articles

Related Articles

Aptitude | GATE CS 1998 | Question 11
  • Last Updated : 10 May, 2020

Regarding the power of recognition of languages, which of the following statement is false?
(A) The non-deterministic finite state automata are equivalent to deterministic finite state automata.
(B) Non-deterministic pushdown automata is equivalent to deterministic pushdown automata.
(C) Non-deterministic Turing machines are equivalent to deterministic Turing machines.
(D) Multi-tape Turing machines are equivalent to Single-tape Turing machines.


Answer: (B)

Explanation: Non-deterministic pushdown automata is NOT equivalent to deterministic pushdown automata.

Option (B) is false.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :