#10872 ⟨
a
,
b
|
aaba
=
bba
,
bbbb
=1⟩
Up:
Monoid enumeration
Prev:
#10859
⟨
a
,
b
|
aaba
=
bab
,
bbbb
=1⟩
Next:
#10887
⟨
a
,
b
|
aabb
=
aaa
,
abab
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
b
3
a
=
a
and
a
⋅ 1 =
a
, however
a
b
3
a
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
2
b
3
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
2
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
2
ba
⇒
b
2
a
[1]
2.
b
4
⇒ 1
[2]
3.
a
2
b
3
a
⇒
a
[3]
# ab:aaba=bba,bbbb=1 ab - - aaba=bba bbbb=1 aabbba=a