#6930 ⟨a, b | bb=aa, aaaaaa=1⟩

Up:Monoid enumeration
Prev:#6917 ⟨a, b | ba=ab, aaabbb=1⟩
Next:#6935 ⟨a, b | bb=aa, aaabab=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. b2 ⇒ a2 [1]
2. ba2 ⇒ a2b [3]
3. a6 ⇒ 1 [2]
# ab:bb=aa,aaaaaa=1 ab - -
bb=aa
baa=aab
aaaaaa=1

Isomorphic instances

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

6 total

Σ#PresentationMapping
106933⟨a, b | bb=aa, aaaabb=1⟩φ(a) = a, φ(b) = b
106936⟨a, b | bb=aa, aaabba=1⟩φ(a) = a, φ(b) = b
106938⟨a, b | bb=aa, aabaab=1⟩φ(a) = a, φ(b) = b
106941⟨a, b | bb=aa, aabbaa=1⟩φ(a) = a, φ(b) = b
106945⟨a, b | bb=aa, abaaba=1⟩φ(a) = a, φ(b) = b
106949⟨a, b | bb=aa, abbbba=1⟩φ(a) = a, φ(b) = b