retagged by
3,079 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)}$
retagged by

1 Answer

Answer:

Related questions

2 votes
2 votes
2 answers
1
go_editor asked Aug 9, 2016
2,096 views
The family of context sensitive languages is _____ under union and ____ under reversalclosed, not closednot closed, not closedclosed, closednot closed, closed
5 votes
5 votes
3 answers
4
Shikha asked Feb 24, 2016
6,831 views
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state$64$$256$$1024$$5832$