#12266 ⟨
a
,
b
|
aaab
=
ab
,
bbba
=
a
⟩
Up:
Monoid enumeration
Prev:
#12265
⟨
a
,
b
|
aaab
=
ab
,
bbab
=
b
⟩
Next:
#12267
⟨
a
,
b
|
aaab
=
ab
,
bbba
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
aba
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:
b
3
⋅
a
=
a
and 1 ⋅
a
=
a
, however
b
3
≠ 1
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
⇒
a
2
[3]
2.
a
3
b
⇒
ab
[1]
3.
b
3
a
⇒
a
[2]
# ab:aaab=ab,bbba=a ab - - aaaa=aa aaab=ab bbba=a