Match the following: a. Context sensitive language b. Regular grammar c.…
2013
Match the following:
a. Context sensitive language
b. Regular grammar
c. Context free grammar
d. Unrestricted grammar
i. Deterministic finite automation
ii. Recursive enumerable
iii. Recursive language
iv. Pushdown automation
Answer: C. iii,i,iv,ii — Regular grammar corresponds to Deterministic Finite Automata (i). Context-free grammar maps to Pushdown Automation (iv). Unrestricted grammar generates…
- A.
ii,i,iv,iii
- B.
iii,iv,i,ii
- C.
iii,i,iv,ii
- D.
ii,iv,i,iii
Attempted by 58 students.
Show answer & explanation
Correct answer: C
Regular grammar corresponds to Deterministic Finite Automata (i). Context-free grammar maps to Pushdown Automation (iv). Unrestricted grammar generates Recursive Enumerable languages (ii). Context-sensitive language matches with Recursive Language (iii) among given options.
A video solution is available for this question — log in and enroll to watch it.