#16416 ⟨
a
,
b
|
aba
=
ab
,
baba
=
bb
⟩
Up:
Monoid enumeration
Prev:
#16412
⟨
a
,
b
|
aba
=
ab
,
baab
=
bb
⟩
Next:
#16418
⟨
a
,
b
|
aba
=
ab
,
babb
=
ab
⟩
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
⋅
ba
=
ab
and
a
⋅
b
=
ab
, however
ba
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
ba
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however
ba
≠
b
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.
aba
⇒
ab
[1]
2.
bab
⇒
b
2
[2]
3.
b
2
a
⇒
b
2
[3]
# ab:aba=ab,baba=bb ab - - aba=ab bab=bb bba=bb