Related papers: A connected 3-state reversible Mealy automaton can…
We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…
In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…
We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…
We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all…
We develop yet another technique to present the free Burnside group $B(m,n)$ of odd exponent $n$ with $m\ge2$ generators as a group satisfying a certain iterated small cancellation condition. Using the approach, we provide a reasonably…
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
We construct a bireversible self-dual automaton with $3$ states over an alphabet with $3$ letters which generates the lamplighter group $\mathbb{Z}_3\wr\mathbb{Z}$.
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise…
We are following [4]. Nevertheless we are interested only in claryfication that the lamplighter group can be realized as a 2--states Mealy machine.
The structure groups of non-degenerate symmetric set-theoretical solutions of the quantum Yang-Baxter equation provide an infinite family of Garside groups with many interesting properties. Given a non-degenerate symmetric solution, we…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
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.
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.
We construct first examples of infinite finitely generated residually finite torsion groups with positive rank gradient. In particular, these groups are non-amenable. Some applications to problems about cost and $L^2$-Betti numbers are…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…
We construct the groups $<A,B,C \;| \, A^2,B^2,C^2,(ABC)^2>$ and $<A,B \;| \, A^2,B^4,(AB)^4>$, using 3-state automata over the alphabets $\{1,2,3\}$ and $\{1,2,3,4\}$. In addition, we show, how to define direct powers of $G$ by automaton…
We consider a very simple Mealy machine (three states over a two-symbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function…
We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite…
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…