  We prove that the semigroup generated by a finite state Mealy automaton
$\mathcal{A}=(Q,A,\tau)$ is infinite if and only if there exists some
right-infinite word in the alphabet $A$ with infinite orbit.
