#6664 ⟨a, b, c | aa=1, abbbc=b⟩

Up:Monoid enumeration
Prev:#6660 ⟨a, b, c | aa=1, abbac=c⟩
Next:#6665 ⟨a, b, c | aa=1, abbbc=c⟩

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. b3c ⇒ ab [3]
# abc:aa=1,abbbc=b abc - -
aa=1
bbbc=ab

Isomorphic instances

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

1 total

Σ#PresentationMapping
87242⟨a, b, c | aa=1, bbbc=ab⟩φ(a) = a, φ(b) = b, φ(c) = c