#108 ⟨a, b, c | ab=a, bcb=1⟩

Up:Monoid enumeration
Prev:#106 ⟨a, b, c | ab=a, bbc=1⟩
Next:#109 ⟨a, b, c | ab=a, bcc=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. ab ⇒ a [1]
2. ac ⇒ a [5]
3. cb ⇒ bc [4]
4. b2c ⇒ 1 [6]
# abc:ab=a,bcb=1 abc - -
ab=a
ac=a
cb=bc
bbc=1

Isomorphic instances

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

2 total

Σ#PresentationMapping
7395⟨a, b, c | abc=a, bcb=1⟩φ(a) = a, φ(b) = b, φ(c) = c
81808⟨a, b, c | aba=ab, aca=1⟩φ(a) = b, φ(b) = a, φ(c) = c