On finite complete rewriting systems and large subsemigroups

Details On finite complete rewriting systems and large subsemigroups On finite complete rewriting systems and large subsemigroups

2010-05-06

arxiv.org/abs/1005.0882v2

Mathematics

Group Theory

We have made major changes to the paper and simplified most of the proofs

Scientific paper

Let $S$ be a semigroup and $T$ be a subsemigroup of finite index in $S$ (that is, the set $S\setminus T$ 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.

Affiliated with

Also associated with

No associations

Rating

On finite complete rewriting systems and large subsemigroups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On finite complete rewriting systems and large subsemigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On finite complete rewriting systems and large subsemigroups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-25584