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

Which of the following three statements are true? Prove your answer.
(i) The union of two recursive languages is recursive.
(ii) The language {0n | n is a prime} is not regular.
(iii) Regular languages are closed under infinite union.


Total 1 Questions



Share: