#3452 ⟨a, b, c | ba=ac, acb=a⟩

Up:Monoid enumeration
Prev:#3451 ⟨a, b, c | ba=ac, abc=c⟩
Next:#3453 ⟨a, b, c | ba=ac, acb=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 ⇒ ba [1]
2. bab ⇒ a [2]
3. a2b ⇒ ba2 [3]
# abc:ba=ac,acb=a bac - -
ac=ba
bab=a
aab=baa

Isomorphic instances

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

1 total

Σ#PresentationMapping
83458⟨a, b, c | ba=ac, bab=a⟩φ(a) = a, φ(b) = b, φ(c) = c