# GALaC team seminar

The GALaC team seminar is organized once a month on Friday at 14:30 in the Ada Lovelace building at LRI.

## Recent and up-coming seminars

## Binary pattern of length greater than 14 are abelian-2-avoidable

Summary: Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w ...

## A concurrent lock-free algorithm for computing a finite semigroup

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 ...

Translations: fr