Computational techniques for automatics semigroups

This project is designed to introduce the student to the area of computational algebra, specifically automatic semigroups and
computational semigroup theory.

The purpose is to investigate automatic semigroups, and their properties by means of computer implementation, for both finite and infinite semigroups. Specific topics considered may include:

- development and implementation of tools to detect whether a given semigroup admits an automatic structure

- development of algorithms to utilise an automatic structure on a semigroup to solve the word problem, the isomorphism problem, to determine the structure of a semigroup, and so on.

- to make available software tools for other researchers

- to generally improve the infrastructure for handling finitely presented semigroups and monoids.





Please list any agreed training requirements:

+ Successful completion of at least 3 SMSTC courses.

+ University wide induction for new PhD students

+ University induction sessions for new tutors

+ Weekly(approx) Pure Maths Colloquia