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

Isomorphic instances

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

7 total

Σ#PresentationMapping
86814⟨a, b, c | ab=1, aabcc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86858⟨a, b, c | ab=1, abacc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86910⟨a, b, c | ab=1, acabc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87434⟨a, b, c | ab=1, acca=aa⟩φ(a) = a, φ(b) = b, φ(c) = c
87496⟨a, b, c | ab=1, bacc=ba⟩φ(a) = a, φ(b) = b, φ(c) = c
87729⟨a, b, c | ab=1, acc=aab⟩φ(a) = a, φ(b) = b, φ(c) = c
87731⟨a, b, c | ab=1, acc=aba⟩φ(a) = a, φ(b) = b, φ(c) = c