#16578 ⟨a, b | aaaa=1, aabaabb=1⟩

Up:Monoid enumeration
Prev:#16559 ⟨a, b | bab=bb, bbb=bab⟩
Next:#16582 ⟨a, b | aaaa=1, aababbb=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. ba2 ⇒ a2b [5]
2. b3 ⇒ 1 [7]
3. a4 ⇒ 1 [1]
# ab:aaaa=1,aabaabb=1 ab - -
baa=aab
bbb=1
aaaa=1

Isomorphic instances

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

4 total

Σ#PresentationMapping
1116583⟨a, b | aaaa=1, aabbaab=1⟩φ(a) = a, φ(b) = b
1116594⟨a, b | aaaa=1, abaabba=1⟩φ(a) = a, φ(b) = b
1116616⟨a, b | aaaa=1, baabaab=1⟩φ(a) = a, φ(b) = b
1117671⟨a, b | aaaa=1, baabb=aa⟩φ(a) = a, φ(b) = b