#4920 ⟨
a
,
b
|
aaaaaba
=
abab
⟩
Up:
Monoid enumeration
Prev:
#4919
⟨
a
,
b
|
aaaaaba
=
abaa
⟩
Next:
#4921
⟨
a
,
b
|
aaaaaba
=
abba
⟩
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
4
ba
= (
ab
)
2
and
a
⋅
bab
= (
ab
)
2
, however
a
4
ba
≠
bab
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.
(
ab
)
2
⇒
a
5
ba
[1]
2.
a
5
b
a
2
b
⇒
ab
a
5
ba
[2]
# ab:aaaaaba=abab a/b - - abab=aaaaaba aaaaabaab=abaaaaaba