Related papers: Connected reversible Mealy automata of prime size …

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite…

The classification of multipartite entanglement is essential as it serves as a resource for various quantum information processing tasks. This study concerns a particular class of highly entangled multipartite states, the so-called…

This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not.…

We prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated: We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated, and on the…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

We prove that for any automorphism $\phi$ of the restricted wreath product $\mathbb{Z}_2 \mathrm{wr} \mathbb{Z}^k$ and $\mathbb{Z}_3 \mathrm{wr} \mathbb{Z}^{2d}$ the Reidemeister number $R(\phi)$ is infinite, i.e. these groups have the…

We investigate the worst-case state complexity of reversals of deterministic finite automata with output (DFAOs). In these automata, each state is assigned some output value, rather than simply being labelled final or non-final. This…

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 to the whole class are formulated. In particular, all finite,…

We consider word automaticity for groups that are nilpotent of class $2$ and have exponent a prime $p$. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special…

We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finite-order elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not…

A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…

We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…

Motivated by the Babai conjecture and the Cerny conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with $n$ states in this class, we…

We introduce two series of finite automata starting from the so-called Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the…

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite…

We construct a finitely generated group which is an extension of two finitely generated groups coarsely embeddable into Hilbert space but which itself does not coarsely embed into Hilbert space. Our construction also provides a new infinite…

Does a space enjoying good finiteness properties admit an algebraic model with commensurable finiteness properties? In this note, we provide a rational homotopy obstruction for this to happen. As an application, we show that the maximal…

We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the…