#10295 ⟨a, b | aa=1, abbba=bbb⟩

Up:Monoid enumeration
Prev:#10289 ⟨a, b | aa=1, abbab=bbb⟩
Next:#10301 ⟨a, b | aa=1, abbbb=bab⟩

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. b3a ⇒ ab3 [3]
# ab:aa=1,abbba=bbb ab - -
aa=1
bbba=abbb

Isomorphic instances

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

1 total

Σ#PresentationMapping
1010528⟨a, b | aa=1, bbba=abbb⟩φ(a) = a, φ(b) = b