#8081 ⟨
a
,
b
|
aaa
=1,
baab
=
bbb
⟩
Up:
Monoid enumeration
Prev:
#8080
⟨
a
,
b
|
aaa
=1,
baab
=
bab
⟩
Next:
#8085
⟨
a
,
b
|
aaa
=1,
babb
=
abb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
ab
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
a
2
b
=
b
3
and
b
⋅
b
2
=
b
3
, however
a
2
b
≠
b
2
Not right cancellative, because right multiplication by
b
is not injective:
b
a
2
⋅
b
=
b
3
and
b
2
⋅
b
=
b
3
, however
b
a
2
≠
b
2
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
3
⇒ 1
[1]
2.
b
a
2
b
⇒
b
3
[2]
# ab:aaa=1,baab=bbb ab - - aaa=1 baab=bbb