Algorithm for Establishing the Equivalence of Deterministic Multitape Automata

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 sufficient equivalence conditions and consists of constructing special (closed) diagrams with the help of elementary operations proposed by M. Bird. The rules for applying these operations are formulated that transform the proposed algorithm into a finite algorithm.