#5883 ⟨
a
,
b
|
ababba
=
aabba
⟩
Up:
Monoid enumeration
Prev:
#5882
⟨
a
,
b
|
ababba
=
aabab
⟩
Next:
#5884
⟨
a
,
b
|
ababba
=
aabbb
⟩
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
⋅
ba
b
2
a
=
a
2
b
2
a
and
a
⋅
a
b
2
a
=
a
2
b
2
a
, however
ba
b
2
a
≠
a
b
2
a
Not right cancellative, because right multiplication by
a
is not injective:
aba
b
2
⋅
a
=
a
2
b
2
a
and
a
2
b
2
⋅
a
=
a
2
b
2
a
, however
aba
b
2
≠
a
2
b
2
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.
aba
b
2
a
⇒
a
2
b
2
a
[1]
# ab:ababba=aabba ab - - ababba=aabba