Finite groups as groups of automata with no cycles with exit
Representations of finite groups as automata groups over a binary alphabet are investigated. The subclass of groups of automata with no cycles with exit is studied.
Saved in:
| Date: | 2018 |
|---|---|
| Main Author: | Russyev, Andriy |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/624 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Groups of linear automata
by: Oliynyk, Andriy
Published: (2018) -
Groups of linear automata
by: Oliynyk, Andriy
Published: (2018) -
On exponentiation, \(p\)-automata and HNN extensions of free abelian groups
by: Oliynyk, A., et al.
Published: (2023) -
The generalized dihedral groups \(Dih(\mathbb{Z}^n)\) as groups generated by time-varying automata
by: Woryna, Adam
Published: (2018) -
Finite automaton actions of free products of groups
by: Fedorova, Mariia, et al.
Published: (2017)