#3191 ⟨a, b, c | ba=ab, acca=1⟩

Up:Monoid enumeration
Prev:#3190 ⟨a, b, c | ba=ab, acbc=1⟩
Next:#3192 ⟨a, b, c | ba=ab, accb=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. ad ⇒ da [6]
2. bd ⇒ db [12]
3. ba ⇒ ab [1]
4. cd ⇒ dc [5]
5. c2 ⇒ d [3]
6. da2 ⇒ 1 [7]
7. ca2 ⇒ a2c [13]
# abc:ba=ab,acca=1 dabc cc=d morph:2/0
ad=da
bd=db
ba=ab
cd=dc
cc=d
daa=1
caa=aac

Isomorphic instances

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

1 total

Σ#PresentationMapping
83194⟨a, b, c | ba=ab, caac=1⟩φ(a) = a, φ(b) = b, φ(c) = c