#256 ⟨a, b, c | ab=1, cac=a⟩

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. cac ⇒ a [2]
3. a2c ⇒ ca2 [3]
# abc:ab=1,cac=a cab - -
ab=1
cac=a
aac=caa

Isomorphic instances

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

7 total

Σ#PresentationMapping
82599⟨a, b, c | aba=b, abac=1⟩φ(a) = c, φ(b) = a, φ(c) = b
86883⟨a, b, c | ab=1, abcac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87078⟨a, b, c | ab=1, caabc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87084⟨a, b, c | ab=1, cabac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87544⟨a, b, c | ab=1, bcac=ba⟩φ(a) = a, φ(b) = b, φ(c) = c
87826⟨a, b, c | ab=1, cac=aab⟩φ(a) = a, φ(b) = b, φ(c) = c
87828⟨a, b, c | ab=1, cac=aba⟩φ(a) = a, φ(b) = b, φ(c) = c