Complete rewriting systems for codified submonoids.

Citation:
Malheiro, A. "Complete rewriting systems for codified submonoids." Int. J. Algebra Comput.. 15 (2005): 207-216.

Abstract:

Given a complete rewriting system R on X and a subset X0 of 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.

Notes:

n/a

Related External Link