in Theory of Computation
287 views
0 votes
0 votes
if L1 and L2 are two context sensitive language and L3 is a context free then

L=L1.L2-L3 is

a)regular

b)context free

c)context sensitive

d)recursive language
in Theory of Computation
by
287 views

4 Comments

OPTION C
0
0

L=L1.L2 ∩ (L3)'     // csl.csl=csl  , (cfl)' is at least csl

csl ∩ csl =csl

1
1
answr is recusive...
0
0
the output language is at least CSL so recursive too. C and D both are answers. if answer is given only D then that's wrong answer.
2
2

Please log in or register to answer this question.