#1193 ⟨a, b | aa=1, abbb=bb⟩

Up:Monoid enumeration
Prev:#1189 ⟨a, b | aa=1, abba=bb⟩
Next:#1200 ⟨a, b | aa=1, babb=bb⟩

Contents

  1. Properties
  2. Rewriting system
  3. Isomorphic instances
  4. Anti-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. b3 ⇒ ab2 [3]
3. bab2 ⇒ b2 [4]
# ab:aa=1,abbb=bb ab - -
aa=1
bbb=abb
babb=bb

Isomorphic instances

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

11 total

Σ#PresentationMapping
81256⟨a, b | aa=1, bbb=abb⟩φ(a) = a, φ(b) = b
109958⟨a, b | aa=1, aaabbb=bb⟩φ(a) = a, φ(b) = b
109996⟨a, b | aa=1, abaabb=bb⟩φ(a) = a, φ(b) = b
1010012⟨a, b | aa=1, abbaab=bb⟩φ(a) = a, φ(b) = b
1010229⟨a, b | aa=1, aaabb=bbb⟩φ(a) = a, φ(b) = b
1010255⟨a, b | aa=1, aabbb=abb⟩φ(a) = a, φ(b) = b
1010267⟨a, b | aa=1, abaab=bbb⟩φ(a) = a, φ(b) = b
1010313⟨a, b | aa=1, baabb=abb⟩φ(a) = a, φ(b) = b
1010494⟨a, b | aa=1, abbb=aabb⟩φ(a) = a, φ(b) = b
1010508⟨a, b | aa=1, baab=abbb⟩φ(a) = a, φ(b) = b
1010524⟨a, b | aa=1, bbaa=abbb⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

6 total

Σ#PresentationMapping
109981⟨a, b | aa=1, aabbba=bb⟩φ(a) = a, φ(b) = b
1010251⟨a, b | aa=1, aabba=bbb⟩φ(a) = a, φ(b) = b
1010258⟨a, b | aa=1, aabbb=bba⟩φ(a) = a, φ(b) = b
1010293⟨a, b | aa=1, abbba=abb⟩φ(a) = a, φ(b) = b
1010316⟨a, b | aa=1, baabb=bba⟩φ(a) = a, φ(b) = b
1010497⟨a, b | aa=1, abbb=abba⟩φ(a) = a, φ(b) = b