#464 ⟨a, b, c | ba=ab, cac=1⟩

Up:Monoid enumeration
Prev:#463 ⟨a, b, c | ba=ab, acc=1⟩
Next:#465 ⟨a, b, c | ba=ab, ccc=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. ca ⇒ ac [3]
2. ba ⇒ ab [1]
3. ac2 ⇒ 1 [4]
4. bc2 ⇒ c2b [7]
# abc:ba=ab,cac=1 acb - -
ca=ac
ba=ab
acc=1
bcc=ccb

Isomorphic instances

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

1 total

Σ#PresentationMapping
84381⟨a, b, c | aba=1, aacb=c⟩φ(a) = c, φ(b) = a, φ(c) = b