Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

49
M: +2.00/-0.66

Consider the following languages over the alphabet ∑= {a,b,c}. Let L1 = {an bncm | m, n >= 0 } and L2 = {ambncn| m, n >= 0}.

Which of the following are context-free languages ?

I. L1 ∪ L2 
II. L1 ∩ L2

[GATE CS 2017 Set 1]
A
B
C
D