Related papers: Decision problems for word-hyperbolic semigroups

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also…

For a fixed word hyperbolic group we compare different residual properties related to quasiconvex subgroups.

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…

In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the…

We prove that in an arbitrary semigroup without cycles, the problem of divisibility and, therefore, the word problem is solvable.

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

We prove that ascending HNN extensions of free groups are word-hyperbolic if and only if they have no Baumslag-Solitar subgroups. This extends the theorem of Brinkmann that free-by-cyclic groups are word-hyperbolic if and only if they have…

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…

We prove an equivariant version of the fact that word-hyperbolic groups have finite asymptotic dimension. This is important in connection with our forthcoming proof of the Farrell-Jones conjecture in algebraic K-theory for every…

Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

We describe solutions of the equation $x^ny^m=a^nb^m$ in acylindrically hyperbolic groups (AH-groups), where $a,b$ are non-commensurable special loxodromic elements and $n,m$ are integers with sufficiently large common divisor. Using this…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…