#4136 ⟨
a
,
b
|
aba
=
aaa
,
bab
=
a
⟩
Up:
Monoid enumeration
Prev:
#4134
⟨
a
,
b
|
aba
=
aaa
,
baa
=
a
⟩
Next:
#4137
⟨
a
,
b
|
aba
=
aaa
,
bab
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
3
=
a
2
and
a
⋅
a
=
a
2
, however
a
3
≠
a
Not right cancellative, because right multiplication by
a
is not injective:
a
3
⋅
a
=
a
2
and
a
⋅
a
=
a
2
, however
a
3
≠
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
2
b
⇒
a
3
[5]
2.
aba
⇒
a
3
[1]
3.
b
a
2
⇒
a
3
[6]
4.
bab
⇒
a
[2]
5.
a
4
⇒
a
2
[4]
# ab:aba=aaa,bab=a ab - - aab=aaa aba=aaa baa=aaa bab=a aaaa=aa