The language complexity of problems in algebra and logic

点击翻译按钮获取中文摘要

This project focuses on a major problem at the intersection of algebra, logic and computer science, concerning equations over free groups and free monoids. Expected outcomes include a language-theoretic characterisation of solutions of equations in a wide class of groups and monoids, a language-theoretic understanding of the existential and first-order theories of free groups, and a classification of groups with indexed multiplication tables and EDT0L word problem. The project is designed to expand the frontiers of knowledge in theoretical computer science and pure mathematics, but in the longer term to deepen our understanding of computers, their computational power and intrinsic limitations.