#26 ⟨a, b, c | ab=1, acc=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. ac2 ⇒ 1 [2]
# abc:ab=1,acc=1 abc - -
ab=1
acc=1

Isomorphic instances

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

8 total

Σ#PresentationMapping
7347⟨a, b, c | aba=a, acc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
7388⟨a, b, c | abc=a, baa=1⟩φ(a) = c, φ(b) = a, φ(c) = b
71124⟨a, b, c | ab=1, aabcc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71138⟨a, b, c | ab=1, abacc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71155⟨a, b, c | ab=1, acabc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71324⟨a, b, c | ab=1, acca=a⟩φ(a) = a, φ(b) = b, φ(c) = c
71344⟨a, b, c | ab=1, bacc=b⟩φ(a) = a, φ(b) = b, φ(c) = c
71484⟨a, b, c | ab=1, acc=ab⟩φ(a) = a, φ(b) = b, φ(c) = c