#4880 ⟨
a
,
b
|
abbbaaab
=
aab
⟩
Up:
Monoid enumeration
Prev:
#4879
⟨
a
,
b
|
abbbaaab
=
aaa
⟩
Next:
#4881
⟨
a
,
b
|
abbbaaab
=
aba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
ab
=
a
b
3
c
and
a
⋅
b
3
c
=
a
b
3
c
, however
ab
≠
b
3
c
Not right cancellative, because right multiplication by
c
is not injective:
a
⋅
c
=
c
b
2
c
and
c
b
2
⋅
c
=
c
b
2
c
, however
a
≠
c
b
2
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
=
aaab
Reduction order:
Left-to-right recursive path with deg(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
ac
⇒
c
b
2
c
[5]
2.
ab
(
b
2
c
)
2
⇒
c
[4]
3.
a
2
b
⇒
a
b
3
c
[3]
# ab:abbbaaab=aab bc/a aaab=c morph:4/1 ac=cbbc abbbcbbc=c aab=abbbc