Abstract:
If input and output alphabets of a Mealy automaton coincide, then one can study the order problem with respect to the superposition operation. The paper provides exact upper bounds on orders of linear automata over finite fields and rationals.
Key words:
Mealy automaton, linear automaton, automata semigroup, order of an element.