Enumerative combinatorics
The Book of Traces
Word Processing in Groups
Recognizable languages in divisibility monoids
Mathematical Structures in Computer Science
Finite transducers for divisibility monoids
Theoretical Computer Science
Hi-index | 0.00 |
Divisibility monoids are a natural algebraic generalisation of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the underlying lattices is kept as a hypothesis, but the relations between the generators are not necessarily supposed to be commutations. Garside monoids are a natural algebraic generalisation of spherical Artin monoids, namely monoids in which the existence of common multiples is kept as a hypothesis, but the relations between the generators are not necessarily supposed to be of Coxeter type. Here, we show that the quasi-centre of these monoids can be studied and described in a similar way, and then we exhibit the intersection between the two classes of monoids.