COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
António Malheiro · International Journal of Algebra and Computation · 2005
Given a complete rewriting system R on X and a subset X0of X+satisfying certain conditions, we present a complete rewriting system for the submonoid of M(X;R) generated by X0. The obtained result will be applied to the group of units of a monoid satisfying H1= D1. On the other hand we prove that all maximal subgroups of a monoid defined by a special rewriting system are isomorphic.