#2761 ⟨a, b, c | abc=b, aaca=1⟩

Up:Monoid enumeration
Prev:#2759 ⟨a, b, c | abc=b, aabb=1⟩
Next:#2762 ⟨a, b, c | abc=b, aacb=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. ba3 ⇒ ab [8]
2. ca3 ⇒ 1 [7]
3. ac ⇒ ca [6]
4. bc ⇒ ca2b [9]
# abc:abc=b,aaca=1 ab/c - -
baaa=ab
caaa=1
ac=ca
bc=caab

Isomorphic instances

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

1 total

Σ#PresentationMapping
82772⟨a, b, c | abc=b, acaa=1⟩φ(a) = a, φ(b) = b, φ(c) = c