edited by
857 views
3 votes
3 votes

Match the following $:$ 

$\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded automaton} \\  \text{b.}& \text{Regular grammar} & \text{ii.} & \text{Pushdown automaton} \\  \text{c.}& \text{Context sensitive  grammar} & \text{iii.} & \text{Turing machine} \\  \text{d.}& \text{Unrestricted grammar} & \text{iv.} & \text{Deterministic finite automaton} \\  \end{array}$

$\textbf{Codes :}$

  1. $\text{a-ii, b-iv, c-iii, d-i}$
  2. $\text{a-ii, b-iv, c-i, d-iii}$
  3. $\text{a-iv, b-i, c-ii, d-iii}$
  4. $\text{a-i, b-iv, c-iii, d-ii}$
edited by

1 Answer

Answer:

Related questions

6 votes
6 votes
7 answers
4