L(A) = L(B)?
Géraud Sénizergues · Electronic Notes in Theoretical Computer Science · 1997
The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational boolean series on the alphabet associated with a dpda M .