#683 ⟨a, b | aaa=1, bbbbb=1⟩

Up:Monoid enumeration
Prev:#663 ⟨a, b | ba=ab, bb=aa⟩
Next:#736 ⟨a, b | aaa=1, aaaa=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. a3 ⇒ 1 [1]
2. b5 ⇒ 1 [2]
# ab:aaa=1,bbbbb=1 ab - -
aaa=1
bbbbb=1

Isomorphic instances

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

7 total

Σ#PresentationMapping
104445⟨a, b | aaab=b, bbbbb=1⟩φ(a) = a, φ(b) = b
107530⟨a, b | aaa=1, abbbbb=a⟩φ(a) = a, φ(b) = b
1121150⟨a, b | aaa=1, aaabbbbb=1⟩φ(a) = a, φ(b) = b
1121176⟨a, b | aaa=1, aabbbbba=1⟩φ(a) = a, φ(b) = b
1121227⟨a, b | aaa=1, baaabbbb=1⟩φ(a) = a, φ(b) = b
1121247⟨a, b | aaa=1, bbaaabbb=1⟩φ(a) = a, φ(b) = b
1122858⟨a, b | aaa=1, bbbbb=aaa⟩φ(a) = a, φ(b) = b