|
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.
Received: 06.10.2023
Citation:
N. V. Muravev, “Maximal finite orders of linear automata over arbitrary field”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2024, no. 5, 71–73; Moscow University Mathematics Bulletin, 79:5 (2024), 262–264
Linking options:
https://www.mathnet.ru/eng/vmumm4633 https://www.mathnet.ru/eng/vmumm/y2024/i5/p71
|
Statistics & downloads: |
Abstract page: | 42 | Full-text PDF : | 11 | References: | 9 |
|