#13234 ⟨
a
,
b
|
baa
=
abb
,
bab
=
ba
⟩
Up:
Monoid enumeration
Prev:
#13233
⟨
a
,
b
|
baa
=
abb
,
bab
=
ab
⟩
Next:
#13235
⟨
a
,
b
|
baa
=
abb
,
bab
=
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
a
is not injective:
a
⋅
b
3
=
a
b
2
and
a
⋅
b
2
=
a
b
2
, however
b
3
≠
b
2
Not right cancellative, because right multiplication by
b
is not injective:
a
b
2
⋅
b
=
a
b
2
and
ab
⋅
b
=
a
b
2
, however
a
b
2
≠
ab
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
3
⇒
a
b
2
[3]
2.
ba
⇒
a
b
2
[5]
3.
a
2
b
2
⇒
a
b
2
[6]
# ab:baa=abb,bab=ba b/a - - abbb=abb ba=abb aabb=abb