33 citations · 34 across the 5 of their papers we have counts for
7 papers
Automata generating free products of groups of order 2
Dmytro Savchuk, Yaroslav Vorobets
We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.
Classification of groups generated by 3-state automata over a 2-letter alphabet
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko +4
This article contains most of the known results on the classification of groups generated by 3-state automata over a 2-letter alphabet, extending the previous papers 0704.3876 and…
Some graphs related to Thompson's group F
Dmytro Savchuk
The Schreier graphs of Thompson's group F with respect to the stabilizer of 1/2 and generators x_0 and x_1, and of its unitary representation in L_2([0,1]) induced by the standard…
Groups generated by 3-state automata over a 2-letter alphabet, II
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko +4
Classification of groups generated by 3-state automata over a 2-letter alphabet started in the first paper (see http://www.arxiv.org/abs/math/0612178) is continued.
The Spectral Problem, Substitutions and Iterated Monodromy
Rostislav Grigorchuk, Dmytro Savchuk, Zoran Sunic
We provide a self-similar measure for the self-similar group acting faithfully on the binary rooted tree, defined as the iterated monodromy group of the quadratic polynomial $z…
Groups generated by 3-state automata over a 2-letter alphabet, I
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko +4
An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related t…