#5536 ⟨a, b, c | ab=c, acaa=c⟩

Up:Monoid enumeration
Prev:#5530 ⟨a, b, c | ab=c, abcb=c⟩
Next:#5542 ⟨a, b, c | ab=c, acba=c⟩

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. aca2 ⇒ c [2]
2. c2a2 ⇒ (ac)2 [4]
3. ab ⇒ c [1]
4. cb ⇒ (ac)2 [3]
# abc:ab=c,acaa=c ac/b - -
acaa=c
ccaa=acac
ab=c
cb=acac

Isomorphic instances

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

1 total

Σ#PresentationMapping
85745⟨a, b, c | aa=b, bcb=ac⟩φ(a) = a, φ(b) = aa, φ(c) = b