Efficient computations of Green's relations and blocks in finite semigroups

In this lecture, I shall present efficient algorithms to compute Green's relations and blocks in finite semigroups. The main result shows that these computations can be done in time O(kn) where n is the size of the semigroup and k is the number of generators.