On classification of groups generated by 3-state automata over a 2-letter alphabet

• Дата: 2008
• Автори: Bondarenko, I., Grigorchuk, R., Kravchenko, R., Muntyan, Y., Nekrashevych, V., Savchuk, D., Sunic, Z.
• Формат: Стаття
• Мова: English
• Опубліковано: Інститут прикладної математики і механіки НАН України 2008
• Назва видання: Algebra and Discrete Mathematics
• Онлайн доступ: http://dspace.nbuv.gov.ua/handle/123456789/152389
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Цитувати: On classification of groups generated by 3-state automata over a 2-letter alphabet / I. Bondarenko, R. Grigorchuk, R. Kravchenko, Y. Muntyan, V. Nekrashevych, D. Savchuk, Z. Sunic // Algebra and Discrete Mathematics. — 2008. — Vol. 7, № 1. — С. 1–163. — Бібліогр.: 50 назв. — англ.

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...