Gate CS-2017-1 Question Paper With Solutions

Q. 52 Consider the following languages over the alphabet ∑= {a,b,c}. Let L₁ = {aⁿ bⁿc^m | m, n >= 0 } and L₂ = {a^mbⁿcⁿ| m, n >= 0}.

Which of the following are context-free languages ?

I. L₁ ∪ L₂
II. L₁ ∩ L₂

(A) I only

(B) II only

(C) I and II

(D) Neither I nor II

Answer: (A)

Explanation: