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

Isomorphic instances

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

7 total

Σ#PresentationMapping
86816⟨a, b, c | ab=1, aabcc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86860⟨a, b, c | ab=1, abacc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86912⟨a, b, c | ab=1, acabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87440⟨a, b, c | ab=1, acca=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87498⟨a, b, c | ab=1, bacc=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87733⟨a, b, c | ab=1, acc=abc⟩φ(a) = a, φ(b) = b, φ(c) = c
87822⟨a, b, c | ab=1, cab=acc⟩φ(a) = a, φ(b) = b, φ(c) = c