#3231 ⟨a, b, c | ba=ac, bbcb=1⟩

Up:Monoid enumeration
Prev:#3230 ⟨a, b, c | ba=ac, bbbc=1⟩
Next:#3232 ⟨a, b, c | ba=ac, bbcc=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. bc ⇒ cb [5]
2. ac ⇒ ba [1]
3. cb3 ⇒ 1 [6]
4. ab3 ⇒ cb2a [8]
# abc:ba=ac,bbcb=1 cba - -
bc=cb
ac=ba
cbbb=1
abbb=cbba

Isomorphic instances

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

1 total

Σ#PresentationMapping
83234⟨a, b, c | ba=ac, bcbb=1⟩φ(a) = a, φ(b) = b, φ(c) = c