2025-02-23T03:41:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-152389%22&qt=morelikethis&rows=5
2025-02-23T03:41:41-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-152389%22&qt=morelikethis&rows=5
2025-02-23T03:41:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T03:41:41-05:00 DEBUG: Deserialized SOLR response
On classification of groups generated by 3-state automata over a 2-letter alphabet
We show that the class of groups generated by 3-state automata over a 2-letter alphabet has no more than 122 members. For each group in the class we provide some basic information, such as short relators, a few initial values of the growth function, a few initial values of the sizes of the quotients...
Saved in:
Main Authors: | Bondarenko, I., Grigorchuk, R., Kravchenko, R., Muntyan, Y., Nekrashevych, V., Savchuk, D., Sunic, Z. |
---|---|
Format: | Article |
Language: | English |
Published: |
Інститут прикладної математики і механіки НАН України
2008
|
Series: | Algebra and Discrete Mathematics |
Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/152389 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
2025-02-23T03:41:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-152389%22&qt=morelikethis
2025-02-23T03:41:41-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%22irk-123456789-152389%22&qt=morelikethis
2025-02-23T03:41:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T03:41:41-05:00 DEBUG: Deserialized SOLR response
Similar Items
-
On classification of groups generated by 3-state automata over a 2-letter alphabet
by: I. Bondarenko, et al.
Published: (2008) -
On classification of groups generated by \(3\)-state automata over a \(2\)-letter alphabet
by: Bondarenko, Ievgen, et al.
Published: (2018) -
Classification of inverse semigroups generated by two-state partially defined invertible automata over the two-symbol alphabet
by: Slupik, J.K.
Published: (2006) -
Non-contracting groups generated by (3,2)-automata
by: Davis, N., et al.
Published: (2014) -
Non-contracting groups generated by (3,2)-automata
by: N. Davis, et al.
Published: (2014)