UGC NET Computer Science July 2018 - II Question 34

Question 34

---

34. Pushdown automata can recognize language generated by ______ .

Options:

1. (1) Only context free grammar
2. (2) Only regular grammar
3. (3) Context free grammar or regular grammar
4. (4) Only context sensitive grammar

Answer: (3) Context free grammar or regular grammar

Explanation Question 34

• Turing Machine recognises ALL
• Linear Bounded Automata recognises context sensitive grammar, Context free grammar, regular grammar
• Push down automata recognises Context free grammar, regular grammar
• Finite Automata recognises only regular grammar

So, Push down automata reconize regular as well as context free grammar.

So, Option (3) is correct answer.

Previous	Next
UGC NET CS 2018 July - II Question 33	UGC NET CS 2018 July - II Question 35