Implementation of some algorithms of combinatorial group theory in the algebraic programming system APS-1 (Q1905234)

We use the Nielsen algorithm as a base for the implementation of algorithms for some problems in the theory of free groups, semigroups, and finite algebras. The paper consists of three parts: the first part presents the necessary information from the theory of groups and finite automata; the second part sets out some problems of the theory of finitely generated free groups (semigroups) with the corresponding solution algorithms; and the third part considers the representation of finite algebras in the APS-1 system and algorithms to evaluate expressions in finite algebras.