#1220 ⟨
a
,
b
|
aabab
=
bbab
⟩
Up:
Monoid enumeration
Prev:
#1219
⟨
a
,
b
|
aabab
=
bbaa
⟩
Next:
#1221
⟨
a
,
b
|
aabab
=
bbba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
b
is not injective:
a
2
ba
⋅
b
=
b
2
ab
and
b
2
a
⋅
b
=
b
2
ab
, however
a
2
ba
≠
b
2
a
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
(
ab
)
2
⇒
b
2
ab
[1]
# ab:aabab=bbab ab - - aabab=bbab