Equality problem is checking if 2 DCFL's or CFL's are producing same language.I read that it is decidable for DCFL and undecidable for CFL.If we consider a DCFL like a^n b^2n / n>=1, here we can draw a PDA for this in two ways. So how can we check if 2 DCFL's produce the same language by just looking at the PDA as they are not unique?
Is Equality problem decidable in DCFL and CFL?
computability;context free;undecidability