#5427 ⟨a, b | aaaa=1, aaabab=1⟩

Up:Monoid enumeration
Prev:#5421 ⟨a, b | aba=bb, bab=aa⟩
Next:#5430 ⟨a, b | aaaa=1, aabaab=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 [4]
2. bab ⇒ a [3]
3. a4 ⇒ 1 [1]
# ab:aaaa=1,aaabab=1 ab - -
baa=aab
bab=a
aaaa=1

Isomorphic instances

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

2 total

Σ#PresentationMapping
105431⟨a, b | aaaa=1, aababa=1⟩φ(a) = a, φ(b) = b
105437⟨a, b | aaaa=1, abaaab=1⟩φ(a) = a, φ(b) = b