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}\}\).











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)