Finite complete rewriting systems for groups (Q4384697)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1145461
Language Label Description Also known as
default for all languages
No label defined
    English
    Finite complete rewriting systems for groups
    scientific article; zbMATH DE number 1145461

      Statements

      Finite complete rewriting systems for groups (English)
      0 references
      0 references
      20 June 1999
      0 references
      finite complete rewriting systems
      0 references
      finitely presented groups
      0 references
      one-relator groups
      0 references
      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}\}\).
      0 references

      Identifiers