Question

The intersection of two csls can simulate an arbitrary turing machine computation, and this can be used to show some problems are undecidable. The intersection of two csls is (choose the false statement)
a. never a recursive set
b. never a cfl
c. never a csl
d. always not r.e.

Answer 1

Answer on Question#38654 – Math - Other

By definition the union, intersection, concatenation and Kleene star of two context-sensitive languages is context-sensitive.

So the false statement is c.