Knuth-Bendix algorithm and the conjugacy problems in monoids
Group Theory
2024-12-04 v1
Abstract
We present an algorithmic approach to the conjugacy problems in monoids, using rewriting systems. We extend the classical theory of rewriting developed by Knuth and Bendix to a rewriting that takes into account the cyclic conjugates.
Cite
@article{arxiv.1012.3547,
title = {Knuth-Bendix algorithm and the conjugacy problems in monoids},
author = {Fabienne Chouraqui},
journal= {arXiv preprint arXiv:1012.3547},
year = {2024}
}
Comments
This is a new version of the paper 'The conjugacy problems in monoids and semigroups'. This version will appear in the journal 'Semigroup forum'