Related papers: Automaton semigroup constructions
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category of ordered groupoids. We compare the holomorph with the monoid of mappings that preserve the ternary heap…
We present a new proof, which is independent of the finite simple group classification and applies also to infinite groups, that quasiprimitive permutation groups of simple diagonal type cannot be embedded into wreath products in product…
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…
Stallings folding theory is modified, using double coset representatives, and to applied to the study of subgroups of amalgamated products of finite rank free groups. As a first application the subgroup membership problem for such groups is…
The study of the free idempotent generated semigroup $\mathrm{IG}(E)$ over a biordered set $E$ began with the seminal work of Nambooripad in the 1970s and has seen a recent revival with a number of new approaches, both geometric and…
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…
Among right-closed monoidal categories with finite coproducts, we characterise those with finite biproducts as being precisely those in which the initial object and the coproduct of the unit with itself admit right duals. This generalises…
We study the connection between small-overlap conditions and automaticity of semigroups. We restrict the discussion to conditions that imply embeddability and under which each relation decomposes into at least seven pieces. For these…
A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…
We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…
For a monoid $M$ and a subsemigroup $S$ of the full transformation semigroup $T_n$, the wreath product $M\wr S$ is defined to be the semidirect product $M^n\rtimes S$, with the coordinatewise action of $S$ on $M^n$. The full wreath product…
We partly generalize the estimate for the rank of intersection of subgroups in free products of groups, proved earlier by S.V.Ivanov and W.Dicks, to the case of free amalgamated products of groups with normal finite amalgamated subgroup. We…
In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…
The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…
It is an old and challenging topic to investigate for which discrete groups G the full group C*-algebra C*(G) is residually finite-dimensional (RFD). In particular not much is known about how the RFD property behaves under fundamental…
In this paper we develop an ideal structure theory for the class of left reductive regular semigroups and apply it to several subclasses of popular interest. In these classes we observe that the right ideal structure of the semigroup is…
We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…