#3604 ⟨a, b, c | aaa=1, aabac=1⟩

Up:Monoid enumeration
Prev:#3602 ⟨a, b, c | bb=ac, cb=aa⟩
Next:#3609 ⟨a, b, c | aaa=1, abaac=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. a3 ⇒ 1 [1]
2. bac ⇒ a [3]
# abc:aaa=1,aabac=1 abc - -
aaa=1
bac=a

Isomorphic instances

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

1 total

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