Doubt

Question

Answer 1

The language L₁ - L₂ will boil down to  {aⁿb^mcⁿ | n>=0 and m>=1}

This can be realised by a Deterministic PDA hence it is DCFL.

So answer is (c).

Comments

here we find that language in L1 but not in L2 so my doubt is here compare a and c in L1 and also compare and c in L2 so how but L is the language which is L1 but not L2 ..plz more explain??

---

See, I have  mentioned m>=1.

Now to explain more-- L₁ is a superset of L₂ because when we put m=0 in L1 we get L2.(this is the key point)

Now L1-L2 implies all the languages where m>=1.

L1-L2 = {aⁿb^mcⁿ | n>=0 and m>=1}

Therefore I concluded that the language is DCFL...

Please tell if you did't understand from this, I will further try to explain it from an example...

---

thks bro i got it