The Equivalence Problem for Deterministic Pushdown Automata is Decidable.

Graud Snizergues

Browse the full ICALP paper archive.