On finite complete rewriting systems and large subsemigroups.
From MaRDI portal
Publication:408518
Abstract: Let be a semigroup and be a subsemigroup of finite index in (that is, the set is finite). The subsemigroup is also called a large subsemigroup of . It is well known that if has a finite complete rewriting system then so does . In this paper, we will prove the converse, that is, if has a finite complete rewriting system then so does . Our proof is purely combinatorial and also constructive.
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
Cites work
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- Artin groups, rewriting systems and three-manifolds
- Finite complete rewriting systems and finite derivation type for small extensions of monoids
- String rewriting systems and finiteness conditions for monoids
- Structure Results for Transitive, Untwisted, Superlinked Finite Covers
Cited in
(5)- Subgroups of finite index in groups with finite complete rewriting systems
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- On certain pairs of non-Engel elements in finite groups.
- IDEALS AND FINITENESS CONDITIONS FOR SUBSEMIGROUPS
- Finite complete rewriting systems for regular semigroups.
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)