#3271 ⟨a, b | aa=1, bbbbbbb=1⟩

Up:Monoid enumeration
Prev:#3199 ⟨a, b | ab=a, bbb=bba⟩
Next:#3375 ⟨a, b | aa=1, ababba=b⟩

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. b7 ⇒ 1 [2]
# ab:aa=1,bbbbbbb=1 ab - -
aa=1
bbbbbbb=1

Isomorphic instances

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

8 total

Σ#PresentationMapping
1118543⟨a, b | aab=b, bbbbbbb=1⟩φ(a) = a, φ(b) = b
1126027⟨a, b | aa=1, aabbbbbbb=1⟩φ(a) = a, φ(b) = b
1126110⟨a, b | aa=1, abbbbbbba=1⟩φ(a) = a, φ(b) = b
1126141⟨a, b | aa=1, baabbbbbb=1⟩φ(a) = a, φ(b) = b
1126171⟨a, b | aa=1, bbaabbbbb=1⟩φ(a) = a, φ(b) = b
1126179⟨a, b | aa=1, bbbaabbbb=1⟩φ(a) = a, φ(b) = b
1126638⟨a, b | aa=1, abbbbbbb=a⟩φ(a) = a, φ(b) = b
1127237⟨a, b | aa=1, bbbbbbb=aa⟩φ(a) = a, φ(b) = b