#365 ⟨a, b, c | aba=b, cac=1⟩

Up:Monoid enumeration
Prev:#364 ⟨a, b, c | aba=b, caa=1⟩
Next:#366 ⟨a, b, c | aba=b, cbc=1⟩

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. ac ⇒ ca [3]
2. c2a ⇒ 1 [6]
3. ab ⇒ bc2 [5]
4. c2b ⇒ ba [8]
# abc:aba=b,cac=1 ca/b - -
ac=ca
cca=1
ab=bcc
ccb=ba

Isomorphic instances

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

1 total

Σ#PresentationMapping
81699⟨a, b, c | aab=bc, aca=1⟩φ(a) = c, φ(b) = b, φ(c) = a