This article is cited in 1 paper

Short notes

Maximal finite orders of linear automata over arbitrary field

N. V. Muravev

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

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.

Key words: Mealy automaton, linear automaton, automata semigroup, order of an element.

UDC: 519.713.2

Received: 06.10.2023

DOI: 10.55959/MSU0579-9368-1-65-5-9

 English version: Moscow University Mathematics Bulletin, Moscow University Mеchanics Bulletin, 2024, 79:5, 262–264

Bibliographic databases:

•