retagged by
1,497 views
2 votes
2 votes

Match the following :

$\begin{array} {} \text{a.}& \text{Context sensitive language} & \text{i.} & \text{Deterministic finite automation} \\  \text{b.}& \text{Regular grammar} & \text{ii.} & \text{Recusive enumerable} \\  \text{c.}& \text{Conext free   grammar} & \text{iii.} & \text{Recursive language} \\  \text{d.}& \text{Unrestricted grammar} & \text{iv.} & \text{Pushdown automation} \\  \end{array}$

Codes:

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

1 Answer

1 votes
1 votes

Ans is (C)

      

a. Context sensitive language Recursive language
b. Regular grammar Deterministifinite automaton
 
 
c. Context free grammar

Pushdown automation

d. Unrestricted grammar Recursive enumerable
Answer:

Related questions

1 votes
1 votes
2 answers
1
2 votes
2 votes
1 answer
2
go_editor asked Jul 24, 2016
2,222 views
Match the following $:$$\begin{array}{} \text{(a)} & \text{Create} & \text{(i)} & \text{The ER model} \\ \text{(b)} & \text{Select} & \text{(ii)} & \text{Relationship m...
3 votes
3 votes
1 answer
4
go_editor asked Jul 17, 2016
1,991 views
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to$ln\mid w \mid$$\mid w \mid$$\mid w \mid^2$$\m...