2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-624%22&qt=morelikethis&rows=5
2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-624%22&qt=morelikethis&rows=5
2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T23:38:25-05:00 DEBUG: Deserialized SOLR response
Finite groups as groups of automata with no cycles with exit

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, Andriy
Format: Article
Language:English
Published: Lugansk National Taras Shevchenko University 2018
Subjects:
automaton
automaton group
finite group
wreath product
20E08
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!

Similar Items

2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-624%22&qt=morelikethis
2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-624%22&qt=morelikethis
2025-02-22T23:38:25-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T23:38:25-05:00 DEBUG: Deserialized SOLR response

Similar Items