Finite groups as groups of automata with no cycles with exit

dc.contributor.author	Russyev, A.
dc.date.accessioned	2019-06-15T16:07:44Z
dc.date.available	2019-06-15T16:07:44Z
dc.date.issued	2010
dc.identifier.citation	Finite groups as groups of automata with no cycles with exit / A. Russyev // Algebra and Discrete Mathematics. — 2010. — Vol. 9, № 1. — С. 86–102. — Бібліогр.: 8 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification:20E08.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/154493
dc.description.abstract	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Finite groups as groups of automata with no cycles with exit	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA