#476 ⟨a, b, c | ba=ac, bbb=1⟩

Up:Monoid enumeration
Prev:#471 ⟨a, b, c | ba=ac, abc=1⟩
Next:#477 ⟨a, b, c | ba=ac, bbc=1⟩

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. b3 ⇒ 1 [2]
# abc:ba=ac,bbb=1 bac - -
ac=ba
bbb=1

Isomorphic instances

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

1 total

Σ#PresentationMapping
84109⟨a, b, c | aaa=1, aabc=b⟩φ(a) = b, φ(b) = a, φ(c) = c