On finite complete rewriting systems and large subsemigroups.

DOI10.1016/J.JALGEBRA.2011.08.022zbMATH Open1241.20067arXiv1005.0882OpenAlexW2963297896MaRDI QIDQ408518FDOQ408518

Authors: K. B. Wong, P. C. Wong 

Publication date: 10 April 2012

Published in: Journal of Algebra (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1005.0882

Recommendations

• Subgroups of finite index in groups with finite complete rewriting systems
• Finite complete rewriting systems for regular semigroups.
• Structure Results for Transitive, Untwisted, Superlinked Finite Covers
• scientific article; zbMATH DE number 2074997
• Finite complete rewriting systems and finite derivation type for small extensions of monoids

zbMATH Keywords

finiteness conditionsrewriting systemslarge subsemigroupspresentations of semigroupssmall extensions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Artin groups, rewriting systems and three-manifolds
• Structure Results for Transitive, Untwisted, Superlinked Finite Covers
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• String rewriting systems and finiteness conditions for monoids

Cited In (5)

• On certain pairs of non-Engel elements in finite groups.
• Finite complete rewriting systems for regular semigroups.
• IDEALS AND FINITENESS CONDITIONS FOR SUBSEMIGROUPS
• Subgroups of finite index in groups with finite complete rewriting systems
• On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids

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)