#6668 ⟨a, b, c | aa=1, abbca=c⟩

Up:Monoid enumeration
Prev:#6667 ⟨a, b, c | aa=1, abbca=b⟩
Next:#6670 ⟨a, b, c | aa=1, abbcb=b⟩

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. b2c ⇒ aca [4]
# abc:aa=1,abbca=c abc - -
aa=1
bbc=aca

Isomorphic instances

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

2 total

Σ#PresentationMapping
87170⟨a, b, c | aa=1, abbc=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87666⟨a, b, c | aa=1, bbc=aca⟩φ(a) = a, φ(b) = b, φ(c) = c