2010/05/06 by Kok Bin Wong, K. B. Wong, Wong, K. B. +2 · 1 citation
Computer Science · Mathematics · #20M05 #20M35 #68Q42 #Advanced Algebra and Logic #FOS: Mathematics #Group Theory (math.GR) #Natural Language Processing Techniques #math.GR #msc:20M05 #msc:20M35 #msc:68Q42 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1005.0882
We have made major changes to the paper and simplified most of the proofs
openalex publication_date 2010/05/06 · arxiv created 2011/08/20 · arxiv updated 2011/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let S be a semigroup and T be a subsemigroup of finite index in S (that is, the set S∖ 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.