Finite complete rewriting systems for groups
From MaRDI portal
The author gives finite complete rewriting systems for some finitely presented groups. For example, let \(G\) be the one-relator group \(\langle A\mid aba^{-1}b^{-1}w\rangle\), where \(A\) is a finite alphabet, \(a,b\in A\) and \(w\) is a word over \(A\) not containing the letters \(a\), \(b\), \(a^{-1}\), \(b^{-1}\). Then, \(G\) admits a complete system \(\overline R=\{xx^{-1}\to 1\;(x\in A\cup A^{-1})\), \(ab\to w^{-1}ba\), \(a^{-1}b^{-1}\to b^{-1}a^{-1}w^{-1}\), \(ab^{-1}\to b^{-1}wa\), \(a^{-1}w^{-1}b\to ba^{-1}\}\).
Recommendations
Cites work
- A catalogue of complete group presentations
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
- scientific article; zbMATH DE number 3688303 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- On theories with a combinatorial definition of 'equivalence'
- Orderings for term-rewriting systems
- Rewriting systems of Coxeter groups
- Systems of reductions
- Term rewriting for the conjugacy problem and the braid groups
Cited in
(16)- Rewriting systems of Coxeter groups
- Constructing finitely presented monoids which have no finite complete presentation
- Geometry of the word problem for 3-manifold groups
- Rewriting systems and complete growth series for triangular Coxeter groups.
- Using groups for investigating rewrite systems
- scientific article; zbMATH DE number 5778575 (Why is no real title available?)
- scientific article; zbMATH DE number 1222454 (Why is no real title available?)
- Finding a finite group presentation using rewriting
- Soluble groups with a finite rewriting system
- scientific article; zbMATH DE number 2074997 (Why is no real title available?)
- Subgroups of finite index in groups with finite complete rewriting systems
- Complete rewriting system for the Schützenberger product of n groups
- Theorem proving with group presentations: examples and questions
- Finite complete rewriting systems for regular semigroups.
- Finding k shortest paths in Cayley graphs of finite groups
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
This page was built for publication: Finite complete rewriting systems for groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384697)