made easy mock

Question

Let L₁ = {aⁿ b^m cⁿ⎪m, n ≥ 0} and L₂ = {aⁿ cⁿ⎪n ≥ 0}. Both L₁ and L₂ are context free languages. If L = (L₁ – L₂) then L is ________

• Finite language
• Regular language
• DCFL
• Not DCFL

can anyone give the elaboration..??

Answer 1

L=(L₁ – L₂)={aⁿb^mcⁿ | n>=0,m>=1}
it is DCFL.

Comments

what is the logic behind subtraction of two languages..??