#489 ⟨a, b | abab=1, baba=1⟩

Up:Monoid enumeration
Prev:#486 ⟨a, b | aabb=1, baba=1⟩
Next:#500 ⟨a, b | aaa=a, bbbb=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. (ab)2 ⇒ 1 [1]
2. (ba)2 ⇒ 1 [2]
# ab:abab=1,baba=1 ab - -
abab=1
baba=1

Isomorphic instances

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

1 total

Σ#PresentationMapping
105922⟨a, b | abab=1, babaa=a⟩φ(a) = a, φ(b) = b