A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The equivalence problem of multitape finite automata
1991
Theoretical Computer Science
Harju, T. and J. KarhumBki, The equiua&xe probizm of multitape fixi~ a:omata f-"iotei, Theoretical Computer Science 78 (1951) 347-355. Using a result of B.H. Neumann we extend Eilenbeg's Equality Theorem to a general ;_wlt which implies that the multiplicity equivaience problem of two <nondererministict muttitape finite automata is decidable. As a corollas we solve a long standing open problem in automata theow. namely, the equivalence problem for multitape deterministic finite automata. The
doi:10.1016/0304-3975(91)90356-7
fatcat:7v6fmoygjvacph4nzxjcakfu4a