Estimation for an output symbol multiplicity in invertible automata

It is shown that the maximum repetition number for an output symbol in the output table of an invertible automaton with $n$ states and $m$ input symbols is $[(n+1)/2][(n+2)/2]$ if $[(n+2)/2]\leq m$, or $(n-m+1)m$ otherwise.