2025-02-22T23:58:49-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-22T23:58:49-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-22T23:58:49-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T23:58:49-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:
| Main Author: | |
|---|---|
| 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!
|
| id |
irk-123456789-154493 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1544932019-06-16T01:31:16Z Finite groups as groups of automata with no cycles with exit Russyev, A. 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. 2010 Article 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. http://dspace.nbuv.gov.ua/handle/123456789/154493 en Algebra and Discrete Mathematics Інститут прикладної математики і механіки НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| 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. |
| format |
Article |
| author |
Russyev, A. |
| spellingShingle |
Russyev, A. Finite groups as groups of automata with no cycles with exit Algebra and Discrete Mathematics |
| author_facet |
Russyev, A. |
| author_sort |
Russyev, A. |
| 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 |
| publisher |
Інститут прикладної математики і механіки НАН України |
| publishDate |
2010 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/154493 |
| 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 назв. — англ. |
| series |
Algebra and Discrete Mathematics |
| work_keys_str_mv |
AT russyeva finitegroupsasgroupsofautomatawithnocycleswithexit |
| first_indexed |
2023-05-20T17:44:52Z |
| last_indexed |
2023-05-20T17:44:52Z |
| _version_ |
1796153995835736064 |