#6671 ⟨a, b, c | aa=1, abbcb=c⟩

Up:Monoid enumeration
Prev:#6670 ⟨a, b, c | aa=1, abbcb=b⟩
Next:#6673 ⟨a, b, c | aa=1, abbcc=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 ⇒ b2cb [3]
2. ab2cb ⇒ c [2]
3. a2 ⇒ 1 [1]
# abc:aa=1,abbcb=c bc/a - -
ac=bbcb
abbcb=c
aa=1

Isomorphic instances

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

1 total

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