#5649 ⟨
a
,
b
|
aabaab
=
aabaa
⟩
Up:
Monoid enumeration
Prev:
#5648
⟨
a
,
b
|
aabaab
=
aaabb
⟩
Next:
#5650
⟨
a
,
b
|
aabaab
=
aabab
⟩
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
c
is not injective:
c
⋅
b
=
c
and
c
⋅ 1 =
c
, however
b
≠ 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:
c
=
aabaa
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.
#
Rule
Proof
1.
cb
⇒
c
[4]
2.
c
a
2
⇒
a
2
bc
[5]
3.
cab
a
2
⇒
a
2
bac
[6]
4.
a
2
b
a
2
⇒
c
[2]
# ab:aabaab=aabaa bc/a aabaa=c magic:0 cb=c caa=aabc cabaa=aabac aabaa=c