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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algebra and Discrete Mathematics
Datum:2010
1. Verfasser: Russyev, A.
Format: Artikel
Sprache:Englisch
Veröffentlicht: Інститут прикладної математики і механіки НАН України 2010
Online Zugang:https://nasplib.isofts.kiev.ua/handle/123456789/154493
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Назва журналу:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Zitieren:Finite groups as groups of automata with no cycles with exit / A. Russyev // Algebra and Discrete Mathematics. — 2010. — Vol. 9, № 1. — С. 86–102. — Бібліогр.: 8 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine
_version_ 1862746948889477120
author Russyev, A.
author_facet Russyev, A.
citation_txt Finite groups as groups of automata with no cycles with exit / A. Russyev // Algebra and Discrete Mathematics. — 2010. — Vol. 9, № 1. — С. 86–102. — Бібліогр.: 8 назв. — англ.
collection DSpace DC
container_title Algebra and Discrete Mathematics
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.
first_indexed 2025-12-07T20:48:19Z
format Article
fulltext
id nasplib_isofts_kiev_ua-123456789-154493
institution Digital Library of Periodicals of National Academy of Sciences of Ukraine
issn 1726-3255
language English
last_indexed 2025-12-07T20:48:19Z
publishDate 2010
publisher Інститут прикладної математики і механіки НАН України
record_format dspace
spelling Russyev, A.
2019-06-15T16:07:44Z
2019-06-15T16:07:44Z
2010
Finite groups as groups of automata with no cycles with exit / A. Russyev // Algebra and Discrete Mathematics. — 2010. — Vol. 9, № 1. — С. 86–102. — Бібліогр.: 8 назв. — англ.
1726-3255
2000 Mathematics Subject Classification:20E08.
https://nasplib.isofts.kiev.ua/handle/123456789/154493
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.
en
Інститут прикладної математики і механіки НАН України
Algebra and Discrete Mathematics
Finite groups as groups of automata with no cycles with exit
Article
published earlier
spellingShingle Finite groups as groups of automata with no cycles with exit
Russyev, A.
title 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_short Finite groups as groups of automata with no cycles with exit
title_sort finite groups as groups of automata with no cycles with exit
url https://nasplib.isofts.kiev.ua/handle/123456789/154493
work_keys_str_mv AT russyeva finitegroupsasgroupsofautomatawithnocycleswithexit