#6652 ⟨
a
,
b
|
aab
=
a
,
bbab
=
ba
⟩
Up:
Monoid enumeration
Prev:
#6645
⟨
a
,
b
|
aab
=
a
,
babb
=
bb
⟩
Next:
#6653
⟨
a
,
b
|
aab
=
a
,
bbab
=
bb
⟩
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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
⇒
a
2
[6]
2.
a
3
⇒
a
[4]
3.
b
2
a
⇒
b
a
2
[7]
# ab:aab=a,bbab=ba ab - - ab=aa aaa=a bba=baa