#4468 ⟨
a
,
b
|
aaaabbab
=
bab
⟩
Up:
Monoid enumeration
Prev:
#4467
⟨
a
,
b
|
aaaabbab
=
baa
⟩
Next:
#4469
⟨
a
,
b
|
aaaabbab
=
bba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
b
is not injective:
a
4
b
2
a
⋅
b
=
bab
and
ba
⋅
b
=
bab
, however
a
4
b
2
a
≠
ba
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
4
b
2
ab
⇒
bab
[1]
# ab:aaaabbab=bab ab - - aaaabbab=bab