A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Revisiting the Equivalence Problem for Finite Multitape Automata
[chapter]
2013
Lecture Notes in Computer Science
The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhumäki in the early 1990s. Their proof of decidability yields a co-NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follows the basic strategy of Harju and Karhumäki but replaces their use of group theory with results on
doi:10.1007/978-3-642-39212-2_38
fatcat:7sahmfxpqngl5i3ry6amlaeumm