#5559 ⟨
a
,
b
,
c
|
ab
=
c
,
baac
=
c
⟩
Up:
Monoid enumeration
Prev:
#5553
⟨
a
,
b
,
c
|
ab
=
c
,
accc
=
c
⟩
Next:
#5567
⟨
a
,
b
,
c
|
ab
=
c
,
baca
=
c
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
d
is not injective:
b
d
2
⋅
d
=
d
and 1 ⋅
d
=
d
, however
b
d
2
≠ 1
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:
d
=
aac
Reduction order:
Left-to-right recursive path with deg(
b
) = deg(
d
) = 0,
b
<
d
; deg(
c
) = deg(
a
) = 1,
c
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
b
d
3
⇒
d
[5]
2.
c
⇒
bd
[4]
3.
ab
⇒
bd
[6]
4.
ad
⇒
d
2
[7]
# abc:ab=c,baac=c bd/ca aac=d morph:3/1 bddd=d c=bd ab=bd ad=dd