On finite complete rewriting systems and large subsemigroups.

From MaRDI portal
Publication:408518




Abstract: Let S be a semigroup and T be a subsemigroup of finite index in S (that is, the set SsetminusT is finite). The subsemigroup T is also called a large subsemigroup of S. It is well known that if T has a finite complete rewriting system then so does S. In this paper, we will prove the converse, that is, if S has a finite complete rewriting system then so does T. Our proof is purely combinatorial and also constructive.









This page was built for publication: On finite complete rewriting systems and large subsemigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408518)