#7132 ⟨a, b, c | aa=1, aabb=cc⟩

Up:Monoid enumeration
Prev:#7131 ⟨a, b, c | aa=1, aabb=cb⟩
Next:#7138 ⟨a, b, c | aa=1, aabc=bc⟩

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. c2 ⇒ b2 [2]
3. cb2 ⇒ b2c [3]
# abc:aa=1,aabb=cc abc - -
aa=1
cc=bb
cbb=bbc

Isomorphic instances

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

2 total

Σ#PresentationMapping
87199⟨a, b, c | aa=1, baab=cc⟩φ(a) = a, φ(b) = b, φ(c) = c
87632⟨a, b, c | aa=1, acc=abb⟩φ(a) = a, φ(b) = b, φ(c) = c