#562 ⟨a, b | aba=b, bbbb=1⟩

Up:Monoid enumeration
Prev:#556 ⟨a, b | aba=b, aabb=1⟩
Next:#563 ⟨a, b | aaa=a, aab=a⟩

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

Isomorphic instances

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

4 total

Σ#PresentationMapping
103951⟨a, b | abab=bb, bbbb=1⟩φ(a) = a, φ(b) = b
106222⟨a, b | aba=b, ababbb=1⟩φ(a) = a, φ(b) = b
106225⟨a, b | aba=b, abbbab=1⟩φ(a) = a, φ(b) = b
106232⟨a, b | aba=b, bababb=1⟩φ(a) = a, φ(b) = b