#247 ⟨a, b, c | ab=1, bac=c⟩

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. bac ⇒ c [2]
# abc:ab=1,bac=c abc - -
ab=1
bac=c

Isomorphic instances

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

7 total

Σ#PresentationMapping
86864⟨a, b, c | ab=1, abbac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86967⟨a, b, c | ab=1, baabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86977⟨a, b, c | ab=1, babac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87490⟨a, b, c | ab=1, baca=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87510⟨a, b, c | ab=1, bbac=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87750⟨a, b, c | ab=1, bac=abc⟩φ(a) = a, φ(b) = b, φ(c) = c
87823⟨a, b, c | ab=1, cab=bac⟩φ(a) = a, φ(b) = b, φ(c) = c