Discussion
Match the following :
| (i) Regular Grammar | (a) Pushdown automaton |
| (ii) Context free Grammar | (b) Linear bounded automaton |
| (iii) Unrestricted Grammar | (c) Deterministic finite automaton |
| (iv) Context Sensitive Grammar | (d) Turing machine |
(i) (ii) (iii) (iv)
Answer: B
A regular grammar generates the languages accepted by a deterministic finite automaton (c). A context free grammar generates the languages accepted by a pushdown automaton (a). An unrestricted grammar generates the languages accepted by a Turing machine (d), and a context sensitive grammar those accepted by a linear bounded automaton (b). So the code is (c), (a), (d), (b), option (B). Options (A), (C) and (D) swap the Turing machine with the linear bounded automaton or the pushdown automaton, which do not match.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development