Abstract. This paper proposes an algorithm to determine the equivalence of multitape automata presented in the form of graphs. The algorithm is based on the theorem (proved by the author) on the sufficient conditions of equivalence and consists in the construction of special (closed) diagrams with the help of elementary operations proposed by M. Bird. The rules for the application of these operations, which make the algorithm finite, are formulated.

Keywords: automaton, multitape, deterministic, equivalence.