#483 ⟨
a
,
b
|
abbbba
=
ab
⟩
Up:
Monoid enumeration
Prev:
#482
⟨
a
,
b
|
abbbba
=
aa
⟩
Next:
#484
⟨
a
,
b
|
abbbba
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
b
=
c
2
and
c
⋅
c
=
c
2
, however
b
≠
c
Rewriting system
Format:
Pretty
Plain
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:
Leftmost
Rightmost
Result:
1
1
Auxiliary generators:
c
=
abbbb
Reduction order:
Left-to-right shortlex with
c
<
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
cb
⇒
c
2
[5]
2.
ab
⇒
ca
[3]
3.
c
4
a
⇒
c
[4]
# ab:abbbba=ab cba abbbb=c morph:5/1 cb=cc ab=ca cccca=c