The word problem for free adequate semigroups
Rings and Algebras
2013-12-02 v1 Computational Complexity
Group Theory
Abstract
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and compute normal forms in each of these, and hence also to test whether any given identity holds in the classes of left, right and/or two-sided adequate semigroups.
Cite
@article{arxiv.1311.7523,
title = {The word problem for free adequate semigroups},
author = {Mark Kambites and Alexandr Kazda},
journal= {arXiv preprint arXiv:1311.7523},
year = {2013}
}
Comments
12 pages