Maximal Finite Orders of Linear Automata over an Arbitrary Field
Nikita Valerevich Muravev · Moscow University Mathematics Bulletin · 2024
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 present paper provides exact upper bounds on orders of linear automata over any field.