#5133 ⟨
a
,
b
|
aabaaba
=
aaaa
⟩
Up:
Monoid enumeration
Prev:
#5132
⟨
a
,
b
|
aabaaab
=
bbbb
⟩
Next:
#5134
⟨
a
,
b
|
aabaaba
=
aaab
⟩
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
⋅ (
aba
)
2
=
a
4
and
a
⋅
a
3
=
a
4
, however (
aba
)
2
≠
a
3
Not right cancellative, because right multiplication by
a
is not injective:
(
a
2
b
)
2
⋅
a
=
a
4
and
a
3
⋅
a
=
a
4
, however (
a
2
b
)
2
≠
a
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 shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
a
2
b
)
2
a
⇒
a
4
[1]
2.
a
5
ba
⇒
a
2
b
a
4
[2]
# ab:aabaaba=aaaa ba - - aabaaba=aaaa aaaaaba=aabaaaa