Q3

MCQ1 mark, −0.33

For any two languages $L_{1}$ and $L_{2}$ such that $L_{1}$ is context-free and $L_{2}$ is recursively enumerable but not recursive, which of the following is/are necessarily true? I only III only III and IV only I and IV only

(A)

$\bar{L}_{1}$ ( Complement of $L_{1}$ ) is recursive

(B)

$\bar{L}_{2}$ ( Complement of $L_{2}$ ) is recursive

(C)

$\bar{L}_{1}$ is context-free

(D)

$\bar{L}_{1}$ ∪ $L_{2}$ is recursively enumerable

Loading…