#1267 ⟨
a
,
b
|
abbba
=
aaba
⟩
Up:
Monoid enumeration
Prev:
#1266
⟨
a
,
b
|
abbba
=
aaab
⟩
Next:
#1268
⟨
a
,
b
|
abbba
=
aabb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
3
a
=
a
2
ba
and
a
⋅
aba
=
a
2
ba
, however
b
3
a
≠
aba
Not right cancellative, because right multiplication by
a
is not injective:
a
b
3
⋅
a
=
a
2
ba
and
a
2
b
⋅
a
=
a
2
ba
, however
a
b
3
≠
a
2
b
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
b
3
a
⇒
a
2
ba
[1]
# ab:abbba=aaba ab - - abbba=aaba