#1098 ⟨
a
,
b
|
aabbba
=
abb
⟩
Up:
Monoid enumeration
Prev:
#1097
⟨
a
,
b
|
aabbba
=
aba
⟩
Next:
#1099
⟨
a
,
b
|
aabbba
=
baa
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
b
3
a
=
a
b
2
and
a
⋅
b
2
=
a
b
2
, however
a
b
3
a
≠
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
=
abb
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
acba
⇒
c
[4]
2.
c
2
ba
⇒
acbc
[6]
3.
a
b
2
⇒
c
[2]
4.
c
b
2
⇒
acbc
[5]
# ab:aabbba=abb ac/b abb=c magic:0 acba=c ccba=acbc abb=c cbb=acbc