#19594 ⟨
a
,
b
|
aab
=
b
,
babba
=
ba
⟩
Up:
Monoid enumeration
Prev:
#19591
⟨
a
,
b
|
aab
=
b
,
babab
=
bb
⟩
Next:
#19595
⟨
a
,
b
|
aab
=
b
,
babba
=
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
2
a
=
ba
and
b
⋅
a
=
ba
, however
a
b
2
a
≠
a
Not right cancellative, because right multiplication by
b
is not injective:
a
2
⋅
b
=
b
and 1 ⋅
b
=
b
, 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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
⇒
b
[1]
2.
ba
b
2
a
⇒
ba
[2]
3.
ba
b
3
⇒
b
2
[3]
# ab:aab=b,babba=ba ab - - aab=b babba=ba babbb=bb