#6272 ⟨
a
,
b
|
aaa
=
a
,
babbb
=
a
⟩
Up:
Monoid enumeration
Prev:
#6271
⟨
a
,
b
|
aaa
=
a
,
babab
=
b
⟩
Next:
#6273
⟨
a
,
b
|
aaa
=
a
,
babbb
=
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
2
=
a
and
a
⋅ 1 =
a
, however
a
2
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
2
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
2
≠ 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 recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
b
24
⇒
a
[17]
2.
ba
⇒
a
b
21
[16]
3.
a
3
⇒
a
[1]
# ab:aaa=a,babbb=a b/a - - abbbbbbbbbbbbbbbbbbbbbbbb=a ba=abbbbbbbbbbbbbbbbbbbbb aaa=a