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

Which of the following problems are undecidable?
(a) Membership problem in context free languages.
(b) Whether a given context free language is regular.
(c) Whether a finite state automation on all inputs.
(d) Membership problem for Type 0 language.


Total 7 Questions



Share: