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.
Збережено в:
Дата: | 2018 |
---|---|
Автор: | |
Формат: | Стаття |
Мова: | English |
Опубліковано: |
Lugansk National Taras Shevchenko University
2018
|
Теми: | |
Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/624 |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematicsid |
oai:ojs.admjournal.luguniv.edu.ua:article-624 |
---|---|
record_format |
ojs |
spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-6242018-04-04T08:18:32Z Finite groups as groups of automata with no cycles with exit Russyev, Andriy automaton, automaton group, finite group, wreath product 20E08 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. Lugansk National Taras Shevchenko University 2018-04-04 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/624 Algebra and Discrete Mathematics; Vol 9, No 1 (2010) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/624/159 Copyright (c) 2018 Algebra and Discrete Mathematics |
institution |
Algebra and Discrete Mathematics |
collection |
OJS |
language |
English |
topic |
automaton automaton group finite group wreath product 20E08 |
spellingShingle |
automaton automaton group finite group wreath product 20E08 Russyev, Andriy Finite groups as groups of automata with no cycles with exit |
topic_facet |
automaton automaton group finite group wreath product 20E08 |
format |
Article |
author |
Russyev, Andriy |
author_facet |
Russyev, Andriy |
author_sort |
Russyev, Andriy |
title |
Finite groups as groups of automata with no cycles with exit |
title_short |
Finite groups as groups of automata with no cycles with exit |
title_full |
Finite groups as groups of automata with no cycles with exit |
title_fullStr |
Finite groups as groups of automata with no cycles with exit |
title_full_unstemmed |
Finite groups as groups of automata with no cycles with exit |
title_sort |
finite groups as groups of automata with no cycles with exit |
description |
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. |
publisher |
Lugansk National Taras Shevchenko University |
publishDate |
2018 |
url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/624 |
work_keys_str_mv |
AT russyevandriy finitegroupsasgroupsofautomatawithnocycleswithexit |
first_indexed |
2024-04-12T06:26:13Z |
last_indexed |
2024-04-12T06:26:13Z |
_version_ |
1796109220675846144 |