#7257 ⟨
a
,
b
,
c
|
aa
=1,
bbcb
=
cb
⟩
Up:
Monoid enumeration
Prev:
#7256
⟨
a
,
b
,
c
|
aa
=1,
bbcb
=
ca
⟩
Next:
#7258
⟨
a
,
b
,
c
|
aa
=1,
bbcb
=
cc
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not right cancellative, because right multiplication by
d
is not injective:
b
2
⋅
d
=
d
and 1 ⋅
d
=
d
, however
b
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
=
cb
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
b
) = deg(
d
) = 0,
a
<
b
<
d
; deg(
c
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
b
2
d
⇒
d
[5]
3.
cb
⇒
d
[3]
4.
cd
⇒
dbd
[6]
# abc:aa=1,bbcb=cb abd/c cb=d morph:2/1 aa=1 bbd=d cb=d cd=dbd