Related papers: Free idempotent generated semigroups: The word pro…
We construct an automaton group with a PSPACE-complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namely EXPSPACE-complete, compressed word problem and acts over a…
This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
Let T_n be the full transformation semigroup of all mappings from the set {1,...,n} to itself under composition. Let E = E(T_n) denote the set of idempotents of T_n and let e be an arbitrary idempotent satisfying |im(e)|=r < n-1. We prove…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
An algebra is finitely related (or has finite degree) if its term functions are determined by some finite set of finitary relations. Nilpotent monoids built from words, via Rees quotients of free monoids, have been used to exhibit many…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
Given a finitely generated relatively hyperbolic group $G$, we construct a finite generating set $X$ of $G$ such that $(G,X)$ has the `falsification by fellow traveler property' provided that the parabolic subgroups $\{H_\omega\}_{\omega\in…
This paper is the first in a sequence on the structure of sets of solutions to systems of equations over a free semigroup. To describe the structure, we present a Makanin-Razborov diagram that encodes the set of solutions to such system of…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
Given a finitely generated group with generating set $S$, we study the cogrowth sequence, which is the number of words of length $n$ over the alphabet $S$ that are equal to one. This is related to the probability of return for walks the…
A new bound for the rank of the intersection of finitely generated subgroups of a free group is given, formulated in topological terms, and very much in the spirit of Stallings. The bound is a contribution to (although unfortunately not a…
We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…
Let $S$ be either a free group or the fundamental group of a closed hyperbolic surface. We show that if $G$ is a finitely generated residually-$p$ group with the same pro-$p$ completion as $S$, then two-generated subgroups of $G$ are free.…
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 provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…