ALL GATE QUESTIONS SUBJECTWISE
×

Regular Language and Finite Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Context Free Language and Pushdown Automata

1 Mark Questions 2 Marks Questions 5 Marks Questions

Contextsensitive Language And Turing Machine

1 Mark Questions 2 Marks Questions 5 Marks Questions

Undecidability

1 Mark Questions 2 Marks Questions




GATE 1998 Question - Mark 1

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 Pushdown automata.
(c) Non-deterministic Turing machines are equivalent to deterministic Push-down automata.
(d) Non-deterministic Turing machines are equivalent to deterministic Turing machines.
(e) Multi-tape Turing machines are equivalent to Single-tape Turing machines


Total 7 Questions



Share: