#238 ⟨a, b, c | ab=1, aca=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. cb ⇒ ac [3]
3. aca ⇒ c [2]
4. c2a ⇒ ac2 [4]
# abc:ab=1,aca=c abc - -
ab=1
cb=ac
aca=c
cca=acc

Isomorphic instances

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

7 total

Σ#PresentationMapping
86810⟨a, b, c | ab=1, aabca=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86854⟨a, b, c | ab=1, abaca=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86909⟨a, b, c | ab=1, acaba=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86924⟨a, b, c | ab=1, acbaa=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87404⟨a, b, c | ab=1, acaa=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87489⟨a, b, c | ab=1, baca=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87721⟨a, b, c | ab=1, aca=abc⟩φ(a) = a, φ(b) = b, φ(c) = c