Question
Consider the following problems:
(a) L is a context sensitive languages (CSL), complement of L is of same type.
(b) Let L1 and L2 is CSL, intersection of L1 and L2 is empty or not.
(c) Finiteness problem in CFGs.
(d) Emptiness problem for CFGs
Which of the following problwms is/are decidable?