|
Mathematics
Order estimates of linear automata
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 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.
Received: 30.04.2021
Citation:
N. V. Muravev, “Order estimates of linear automata”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 6, 8–14; Moscow University Mathematics Bulletin, 77:6 (2022), 262–268
Linking options:
https://www.mathnet.ru/eng/vmumm4502 https://www.mathnet.ru/eng/vmumm/y2022/i6/p8
|
Statistics & downloads: |
Abstract page: | 77 | Full-text PDF : | 34 | References: | 11 |
|