**"Computing with free bands"**,
York Semigroup seminar, York, U.K.,
November 2023,
(slides).

**Abstract:**
A band is a semigroup whose elements are all idempotent. Perhaps surprisingly,
it turns out that all finitely generated bands are finite. Despite this,
existing methods for computing with finite or finitely generated semigroups,
such as the Todd-Coxeter and Knuth-Bendix algorithms, are inefficient or
inapplicable to bands. In this talk we will focus on the special case of free
bands and showcase a way of solving the word problem and computing minimal
representatives by using coloured binary trees.

**"Making the Knuth-Bendix algorithm exponentially slower"**,
Semigroups Day,
St Andrews, U.K.,
June 2023,
(slides).

**Abstract:**
The Knuth-Bendix algorithm takes as input a semigroup presentation
and, if the algorithm terminates, produces a complete rewriting system and
hence a solution to the word problem. But what can we do in cases where the
algorithm does not seem to terminate? In this talk we will utilize termination
provers to augment the Knuth-Bendix algorithm with a backtrack search. We will
then apply this new version of the algorithm to solve hard instances of the one
relation monoid word problem. This is joint work with James Mitchell and Finn
Smith.