A concurrent lock-free algorithm for computing a finite semigroup
Time: 14:30 -- Location: LRI, 445
Summary: In this talk I will present a concurrent lock-free version of the Froidure-Pin Algorithm for computing a finite semigroup. This algorithm computes a subsemigroup S generated by some given elements of a finite semigroup of a certain type, such as transformations, partial permutations, square matrices over a semiring, bipartitions, and partitioned binary relations. Similar to the original Froidure-Pin Algorithm, this algorithm produces the left and right Cayley graphs of S, and a confluent terminating presentation defining S. This algorithm is implemented in the C++ library libsemigroups: https://james-d-mitchell.github.io/libsemigroups/