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

Isomorphic instances

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

6 total

Σ#PresentationMapping
86885⟨a, b, c | ab=1, abcac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87080⟨a, b, c | ab=1, caabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87086⟨a, b, c | ab=1, cabac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87546⟨a, b, c | ab=1, bcac=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87830⟨a, b, c | ab=1, cac=abc⟩φ(a) = a, φ(b) = b, φ(c) = c
87844⟨a, b, c | ab=1, cac=cab⟩φ(a) = a, φ(b) = b, φ(c) = c