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 2004 Question - Marks 5

State whether the following statements are TRUE/FALSE.
(a) Regularity is preserved under the operation of string reversal.
(b) All subsets of regular sets are regular.
(c) A minimal DFA that is equivalent to an NDFA with n nodes has always 2n states.
(d) The intersection of two CFL’s is also CFL.
(e) A is recursive if both a and its complement are accepted by Turing Machine M accepts.
(f) The problem whether Turing Machine M accepts input w is undecidable.


Total 1 Questions



Share: