#187 ⟨a, b, c | ab=1, acac=1⟩

Contents

  1. Properties
  2. Rewriting system
  3. Isomorphic instances

Properties

Rewriting system

Format:
Word:
Enter a word above to compute its normal form. Tips:
  • Lowercase letters stand for generators.
  • Spaces are ignored.
  • Numbers repeat the previous letter, e.g. b90.
Strategy:
Result: 1
1
#RuleProof
1. ab ⇒ 1 [1]
2. (ac)2 ⇒ 1 [2]
# abc:ab=1,acac=1 abc - -
ab=1
acac=1

Isomorphic instances

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

9 total

Σ#PresentationMapping
82570⟨a, b, c | aba=a, acac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
82704⟨a, b, c | abc=a, baba=1⟩φ(a) = c, φ(b) = a, φ(c) = b
86304⟨a, b, c | ab=1, aabcac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86348⟨a, b, c | ab=1, abacac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86397⟨a, b, c | ab=1, acaabc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86402⟨a, b, c | ab=1, acabac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86913⟨a, b, c | ab=1, acaca=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86991⟨a, b, c | ab=1, bacac=b⟩φ(a) = a, φ(b) = b, φ(c) = c
87408⟨a, b, c | ab=1, acac=ab⟩φ(a) = a, φ(b) = b, φ(c) = c