Three write heads are as good ask

Nondeterministic one-wayk-head writing finite automata are investigated. It is shown that 3-head automata with one read-write head followed by two read-only heads are as powerful as any multihead automaton. Furthermore, a new way to detect a coincidence of heads is introduced, which has as a consequence that it makes no difference, whether the heads make stationary moves ore-moves.