#7146 ⟨a, b, c | aa=1, abab=cc⟩

Up:Monoid enumeration
Prev:#7145 ⟨a, b, c | aa=1, abab=cb⟩
Next:#7151 ⟨a, b, c | aa=1, abac=bb⟩

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. a2 ⇒ 1 [1]
2. bab ⇒ ac2 [3]
3. c2ab ⇒ abc2 [4]
# abc:aa=1,abab=cc abc - -
aa=1
bab=acc
ccab=abcc

Isomorphic instances

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

1 total

Σ#PresentationMapping
87641⟨a, b, c | aa=1, bab=acc⟩φ(a) = a, φ(b) = b, φ(c) = c