#5497 ⟨
a
,
b
|
aaaaba
=
bbbaa
⟩
Up:
Monoid enumeration
Prev:
#5496
⟨
a
,
b
|
aaaaba
=
bbabb
⟩
Next:
#5498
⟨
a
,
b
|
aaaaba
=
bbbab
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
a
is not injective:
a
4
b
⋅
a
=
b
3
a
2
and
b
3
a
⋅
a
=
b
3
a
2
, however
a
4
b
≠
b
3
a
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
Reduction order:
Left-to-right recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
3
a
2
⇒
a
4
ba
[1]
# ab:aaaaba=bbbaa a/b - - bbbaa=aaaaba