#357 ⟨a, b, c | aba=b, aca=1⟩

Up:Monoid enumeration
Prev:#356 ⟨a, b, c | aba=b, abc=1⟩
Next:#358 ⟨a, b, c | aba=b, acb=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. ca ⇒ ac [3]
2. a2c ⇒ 1 [7]
3. ab ⇒ bac [4]
4. cb ⇒ ba2 [6]
# abc:aba=b,aca=1 ac/b - -
ca=ac
aac=1
ab=bac
cb=baa

Isomorphic instances

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

1 total

Σ#PresentationMapping
81975⟨a, b, c | abc=ba, bcb=1⟩φ(a) = b, φ(b) = a, φ(c) = c