Free groups defined by finite $p$-automata
For every odd prime $p$ we construct two $p$-automata with 14 inner states and prove that the group generated by 2 automaton permutations defined at their states is a free group of rank 2.
Main Authors: | A.P. Krenevych, A.S. Oliynyk |
---|---|
Format: | Article |
Language: | English |
Published: |
Oles Honchar Dnipro National University
2023-12-01
|
Series: | Researches in Mathematics |
Subjects: | |
Online Access: | https://vestnmath.dnu.dp.ua/index.php/rim/article/view/409/409 |
Similar Items
-
The reversibility of one-dimensional cellular automata
by: Alexey E. Zhukov
Published: (2021-08-01) -
Automata Approach to XML Data Indexing
by: Eliška Šestáková, et al.
Published: (2018-01-01) -
On residually finite semigroups of cellullar automata
by: Tullio Ceccherini-Silberstein, et al.
Published: (2015-06-01) -
Higher-Dimensional Timed and Hybrid Automata
by: Fahrenberg, Uli
Published: (2022-12-01) -
Elementary definability of the class of universal hypergraphic automata in the class of semigroups
by: Molchanov, Vladimir Aleksandrovich, et al.
Published: (2022-08-01)