On finite complete rewriting systems and large subsemigroups

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.Comment: We have made major changes to the paper and simplified most of the proof

On semigroups of endomorphisms of a chain with restricted range

Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a nonempty subset of $X$ and $O(X,Y)$ the subsemigroup of $O(X)$ of all elements with range contained in $Y$, we characterize the largest regular subsemigroup of $O(X,Y)$ and Green's relations on $O(X,Y)$. Moreover, for finite chains, we determine when two semigroups of the type $O(X,Y)$ are isomorphic and calculate their ranks.Comment: To appear in Semigroup Foru

Generalized Green'S Equivalences on the Subsemigroups of the Bicyclic Monoid

We study generalized Green's equivalences on all subsemigroups of the bicyclic monoid B and determine the abundant (and adequate) subsemigroups of B. © 2010 Copyright Taylor and Francis Group, LLC