#4841 ⟨
a
,
b
|
ababbaba
=
aba
⟩
Up:
Monoid enumeration
Prev:
#4840
⟨
a
,
b
|
ababbaba
=
aab
⟩
Next:
#4842
⟨
a
,
b
|
ababbaba
=
abb
⟩
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
⋅ (
bab
)
2
a
=
aba
and
a
⋅
ba
=
aba
, however (
bab
)
2
a
≠
ba
Not right cancellative, because right multiplication by
a
is not injective:
a
(
bab
)
2
⋅
a
=
aba
and
ab
⋅
a
=
aba
, however
a
(
bab
)
2
≠
ab
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
(
bab
)
2
a
⇒
aba
[1]
# ab:ababbaba=aba ab - - ababbaba=aba