#19704 ⟨
a
,
b
|
aba
=
b
,
aaaaa
=
aa
⟩
Up:
Monoid enumeration
Prev:
#19703
⟨
a
,
b
|
aba
=
a
,
bbbbb
=
bb
⟩
Next:
#19706
⟨
a
,
b
|
aba
=
b
,
aaaaa
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
a
3
=
b
and
b
⋅ 1 =
b
, however
a
3
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
4
⋅
a
=
a
2
and
a
⋅
a
=
a
2
, however
a
4
≠
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
5
⇒
a
2
[2]
2.
b
a
3
⇒
b
[4]
3.
ab
⇒
b
a
2
[5]
# ab:aba=b,aaaaa=aa a/b - - aaaaa=aa baaa=b ab=baa