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 :}$
Sir, What is d-i(d- L is a recursive language, i-but not recursive language) in option C ??
Explanation for b
C option ans
64.3k questions
77.9k answers
244k comments
80.0k users