#1475 ⟨a, b | aaa=bb, bbbb=1⟩

Up:Monoid enumeration
Prev:#1472 ⟨a, b | aaa=bb, abbb=1⟩
Next:#1491 ⟨a, b | aab=aa, bbbb=1⟩

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 ⇒ b2 [1]
2. b2a ⇒ ab2 [3]
3. b4 ⇒ 1 [2]
# ab:aaa=bb,bbbb=1 ab - -
aaa=bb
bba=abb
bbbb=1

Isomorphic instances

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

7 total

Σ#PresentationMapping
104805⟨a, b | aaa=bb, aaabb=1⟩φ(a) = a, φ(b) = b
104808⟨a, b | aaa=bb, aabba=1⟩φ(a) = a, φ(b) = b
104816⟨a, b | aaa=bb, baaab=1⟩φ(a) = a, φ(b) = b
1110781⟨a, b | aaab=bbb, bbbb=1⟩φ(a) = a, φ(b) = b
1113437⟨a, b | aaabb=1, aaaaaa=1⟩φ(a) = a, φ(b) = b
1113601⟨a, b | aabba=1, aaaaaa=1⟩φ(a) = a, φ(b) = b
1114973⟨a, b | aaa=bb, aaaaaa=1⟩φ(a) = a, φ(b) = b