A short proof on the cyclic behaviour of multithreshold symmetric automata

It is shown that there exists a monomorphism from a multithreshold symmetric automata into a binary threshold symmetric automata. This implies that both automata have the same transient and cyclic behaviour. By a theorem proved in Goles and Olivos (1981) we conclude that a multithrehold symmetric automata does not have cycles of length greater than two.