#5017 ⟨
a
,
b
|
aaabaaa
=
abbb
⟩
Up:
Monoid enumeration
Prev:
#5016
⟨
a
,
b
|
aaabaaa
=
abba
⟩
Next:
#5018
⟨
a
,
b
|
aaabaaa
=
baab
⟩
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
⋅
a
2
b
a
3
=
a
b
3
and
a
⋅
b
3
=
a
b
3
, however
a
2
b
a
3
≠
b
3
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.
a
b
3
⇒
a
3
b
a
3
[1]
# ab:aaabaaa=abbb a/b - - abbb=aaabaaa