#6157 ⟨a, b, c | aa=1, abbabc=1⟩

Up:Monoid enumeration
Prev:#6155 ⟨a, b, c | aa=1, abaccc=1⟩
Next:#6159 ⟨a, b, c | aa=1, abbacc=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. a2 ⇒ 1 [1]
2. b2abc ⇒ a [3]
# abc:aa=1,abbabc=1 abc - -
aa=1
bbabc=a

Isomorphic instances

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

1 total

Σ#PresentationMapping
86739⟨a, b, c | aa=1, bbabc=a⟩φ(a) = a, φ(b) = b, φ(c) = c