A complete rewrite system and normal forms for (S)_reg

Simple item page
dc.creatorBirget, Jean-Camille
dc.creatorMargolis, Stuart W.
dc.date2001-12-20
dc.date.accessioned2026-07-07T04:45:25Z
dc.date.available2026-07-07T04:45:25Z
dc.descriptionThe (.)_reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)_reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show that (S)_reg can be described by a rather simple complete string rewrite system, as a consequence of which we obtain a new proof of the normal form theorem for (S)_reg. The new proof of the normal form theorem is conceptually simpler than the previous proofs.
dc.identifierhttps://arxiv.org/abs/math/0112229
dc.identifierhttp://arxiv.org/abs/math/0112229
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62945
dc.subjectGroup Theory
dc.subject29M05; 20M17; 68W30
dc.titleA complete rewrite system and normal forms for (S)_reg
dc.typetext

Files

Collections

arXiv