1.

Match the following:(i) Regular Grammar (ii) Context free Grammar (iii) Unrestricted Grammar (iv) Context Sensitive Grammar (a) Pushdown automaton(b) Linear bounded automaton(c) Deterministic finite automaton(d) Turing machine (i) (ii) (iii) (iv)

A. (c)(a)(b)(d)
B. (c)(a)(d)(b)
C. (c)(b)(a)(d)
D. (c)(b)(d)(a)
Answer» C. (c)(b)(a)(d)


Discussion

No Comment Found