2025-02-23T00:03:24-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-154493%22&qt=morelikethis&rows=5
2025-02-23T00:03:24-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-154493%22&qt=morelikethis&rows=5
2025-02-23T00:03:24-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T00:03:24-05:00 DEBUG: Deserialized SOLR response

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:
Bibliographic Details
Main Author: Russyev, A.
Format: Article
Language:English
Published: Інститут прикладної математики і механіки НАН України 2010
Series:Algebra and Discrete Mathematics
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/154493
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.