An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA

A simple technique for deciding equivalence of two dpda's from different classes is presented by constructing an intermediate machine and checking it against each of the original machines. Using this technique, a simple algorithm is found for deciding equivalence of two dpda's, one of which is 1-turn. This algorithm may be contrasted with the more general but much more complicated algorithms presented by Greibach and Friedman and by Oyamaguchi, Inagaki, and Honda