1.2k views

Match the following:

 List-I List-II a. $\{a^n b^n \mid n > 0\}$ is a deterministic context free language i. but not recursive language b. The complement of $\{a^n b^n a^n \mid n>0\}$ is a context free language ii. but not context free language c. $\{a^nb^na^n\}$ is a context sensitive lagnuage iii. but cannot be accepted by a deterministic pushdown automaton d. L is a recursive language iv. but not regular
1. a-i, b-ii, c-iii, d-iv
2. a-i, b-ii, c-iv, d-iii
3. a-iv, b-iii, c-ii, d-i
4. a-iv, b-iii, c-i, d-ii

recategorized | 1.2k views
+1
option c.
0

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

0

C option ans

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