#6692 ⟨a, b, c | aa=1, abccb=c⟩

Up:Monoid enumeration
Prev:#6691 ⟨a, b, c | aa=1, abccb=b⟩
Next:#6694 ⟨a, b, c | aa=1, abccc=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. ac ⇒ bc2b [3]
2. abc2b ⇒ c [2]
3. a2 ⇒ 1 [1]
# abc:aa=1,abccb=c bc/a - -
ac=bccb
abccb=c
aa=1

Isomorphic instances

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

1 total

Σ#PresentationMapping
87273⟨a, b, c | aa=1, bccb=ac⟩φ(a) = a, φ(b) = b, φ(c) = c