#1025 ⟨a, b, c | ab=c, aca=c⟩

Up:Monoid enumeration
Prev:#1024 ⟨a, b, c | ab=c, aca=b⟩
Next:#1027 ⟨a, b, c | ab=c, acb=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. aca ⇒ c [2]
2. c2a ⇒ ac2 [4]
3. ab ⇒ c [1]
4. cb ⇒ ac2 [3]
# abc:ab=c,aca=c ac/b - -
aca=c
cca=acc
ab=c
cb=acc

Isomorphic instances

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

2 total

Σ#PresentationMapping
85496⟨a, b, c | ab=c, aaba=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86033⟨a, b, c | ab=c, aca=ab⟩φ(a) = a, φ(b) = b, φ(c) = c