An efficient algorithm for determining the equivalence of two deterministic multitape finite automata is suggested. It is based on an already published proof of solvability for this problem. It is shown that the suggested algorithm has polynomial complexity. The asymptotic running time of the algorithm is bounded by $k⁎s^{n+1}$, where k is some constant, n is the number of tapes and s is the sum of the number of states for the considered automata.

中文翻译：

---

确定性多带有限自动机等价问题的多项式算法

提出了一种确定两个确定性多带有限自动机等价性的有效算法。它基于已发布的针对该问题的可解决性证明。结果表明，该算法具有多项式复杂度。该算法的渐近运行时间受以下条件限制$ķ⁎s^{ñ+\mathrm{1个}}$，其中k是某个常数，n是磁带数，s是所考虑的自动机的状态数之和。