in Theory of Computation retagged by
3,106 views
4 votes
4 votes

Match the following $:$

$\begin{array}{clcl}   & \textbf{List – I} & & \textbf{List – II} \\   \text{(a)} & \{a^n b^n \mid n > 0\}  \text{ is a deterministic } & \text{(i)} & \text{but not recursive language}\\ & \text{ context free language} \\  \text{(b)} & \text{The complement of }\{a^n b^n a^n \mid n>0\} & \text{(ii)} & \text{but not context free language}\\ & \text{is a context free language} \\  \text{(c)} & \{a^nb^na^n\}\text{ is a context sensitive} & \text{(iii)} & \text{but cannot be accepted by a } \\&  \text{ language} && \text{deterministic pushdown }\\ &&& \text{automaton} \\  \text{(d)} & \text{L is a recursive language} & \text{(iv)} &\text{but not regular} \\  \end{array}$

$\textbf{Codes :}$

  1. $\text{(a)-(i), (b)-(ii), (c)-(iii), (d)-(iv)}$
  2. $\text{(a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)}$
  3. $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
  4. $\text{(a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)}$
in Theory of Computation retagged by
3.1k views

3 Comments

option c.
1
1

Sir, What is d-i(d- L is a recursive language, i-but not recursive language)  in option C  ??

0
0
0
0

1 Answer

3 votes
3 votes
Best answer

C option ans 

selected by

2 Comments

D OPTION MATCH IS NOT CORRECT IN QUESTION SO MARKS TO ALL
0
0
option c matching except d (i)
0
0
Answer:

Related questions