made easy_TOC

Question

I think below is CFL, we need two copies but answer given is DCFL..please help for below lang.
L= {a bⁿ aⁿ | n>0} U {aa b^k a^2k | k>0 }

Comments

@anirudh

i did same but finally we need two final states rytt??

---

for DCFL, the only condition is that it should be unambiguous and no. of a's making in this example making it unambiguous. therefor it is DCFL but @cse23 from where have you read that DCFL can not contain more than one final state? I am not aware of this condition!

---

ok what I thought that we need two copies of PDA for this. But fine we can proceed with one PDA only....so it is DCFL..got it:)