Minimality and deadlockness of multitape automata

We consider the class $M$ of deterministic binary two-tape automata for which those states of the automaton where reading from the additional second tape is implemented permit to continue the calculation only in the case where the read symbol is fixed in advance for all automata. For the automata of the class $M$, the so-called generalised minimisation problem is considered. This problem consists in finding all automata which are minimal in the number of states in any class of equivalent automata of $M$. In the paper, the decidability of the generalised minimisation problem in $M$ is proved and a procedure to solve this problem is described and analysed.