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

Isomorphic instances

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

4 total

Σ#PresentationMapping
71298⟨a, b, c | ab=1, abac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
71461⟨a, b, c | ab=1, abc=ac⟩φ(a) = a, φ(b) = b, φ(c) = c
71474⟨a, b, c | ab=1, aca=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
71502⟨a, b, c | ab=1, bac=bc⟩φ(a) = a, φ(b) = b, φ(c) = c