Application of automata and transducers to computational semigroup theory

在这个项目中，我们将研究自动机和转换器在计算半群理论中的应用。在短期内，在Radoszewski-Rytter最近工作的基础上，我们将开发一个具有良好计算性质的自由幂等半群中的单词表示，该半群可用于等式测试，乘法和最小单词表示。从长远来看，我们的目标是将其扩展到各种半群中的自由对象。该项目将包括指定领域的原创理论研究，开发算法的参考实现，以及开源C++库libsemigroups（https：//github.com/libsemigroups/libsemigroups）中的优化实现。

In this project we will investigate applications of automata and transducers to problems in computational semigroup theory. In the short term, building on recent work of Radoszewski-Rytter we will develop a representation for words in free idempotent semigroups with good computational properties which can be used for equality testing, multiplication, and minimal word representations. In the longer term, we aim to expand this to the free objects in various varieties of semigroups. The project will consist of original theoretical research in the specified domain, reference implementations of the developed algorithms, and optimised implementation in the open source C++ library libsemigroups (https://github.com/libsemigroups/libsemigroups).