Application of automata and transducers to computational semigroup theory

自动机和传感器在计算半群论中的应用

• 批准号: 2590267
• 金额: --
• 依托单位: University of St Andrews
• 依托单位国家: 英国
• 项目类别: Studentship
• 财政年份: 2021
• 资助国家: 英国
• 起止时间: 2021 至 无数据
• 项目状态: 未结题
• 来源: https://gtr.ukri.org/projects?ref=studentship-2590267
• 关键词: Application; automata; transducers; computational; semigroup

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

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