The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+3 votes
1k 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
in Theory of Computation by Veteran (103k points)
recategorized by | 1k 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

1 Answer

+2 votes
Best answer

C option ans 

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

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,362 questions
55,786 answers
192,410 comments
90,919 users