A complete rewrite system and normal forms for (S)reg
Abstract
The (.)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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.