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 1990 Question - Marks 2

Recursive language are:
(a) A proper subset of context-free languages.
(b) Always recognizable by pushdown automata.
(c) Also called Type(0) language.
(d) Recognizable by Turing machine.


Total 14 Questions



Share: