Bounds on Orders of Linear Automata
Nikita Valerevich Muravev · Moscow University Mathematics Bulletin · 2022
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.