#13176 ⟨
a
,
b
|
aba
=
aab
,
bbb
=
ba
⟩
Up:
Monoid enumeration
Prev:
#13175
⟨
a
,
b
|
aba
=
aab
,
bbb
=
ab
⟩
Next:
#13177
⟨
a
,
b
|
aba
=
aab
,
bbb
=
bb
⟩
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
b
is not injective:
b
⋅
a
=
b
3
and
b
⋅
b
2
=
b
3
, however
a
≠
b
2
Not right cancellative, because right multiplication by
b
is not injective:
a
2
⋅
b
=
a
b
3
and
a
b
2
⋅
b
=
a
b
3
, however
a
2
≠
a
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 recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ba
⇒
b
3
[2]
2.
a
2
b
⇒
a
b
3
[3]
# ab:aba=aab,bbb=ba b/a - - ba=bbb aab=abbb