Decidability of DPDA equivalence

Colin Stirling

Abstract:

A proof of decidability of equivalence between deterministic
pushdown automata is presented using a mixture of methods developed
in concurrency and language theory. The technique appeals to a
tableau proof system for equivalence of configurations of strict
deterministic grammars.