#226 ⟨a, b, c | aa=1, bcb=c⟩

Up:Monoid enumeration
Prev:#225 ⟨a, b, c | aa=1, bcb=b⟩
Next:#229 ⟨a, b, c | ab=1, aac=a⟩

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. a2 ⇒ 1 [1]
2. bcb ⇒ c [2]
3. c2b ⇒ bc2 [3]
# abc:aa=1,bcb=c abc - -
aa=1
bcb=c
ccb=bcc

Isomorphic instances

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

4 total

Σ#PresentationMapping
86636⟨a, b, c | aa=1, aabcb=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86705⟨a, b, c | aa=1, baacb=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87181⟨a, b, c | aa=1, abcb=ac⟩φ(a) = a, φ(b) = b, φ(c) = c
87679⟨a, b, c | aa=1, bcb=aac⟩φ(a) = a, φ(b) = b, φ(c) = c