Sufficient conditions of equivalence of three-tape automata

The notion of closed diagram is applied to formulate a condition of equivalence of three-tape deterministic automata and to prove its sufficiency. The construction of an algorithm to decide the equivalence is such automata based on closed diagrams is demonstrated with examples.