#10063 ⟨
a
,
b
|
aa
=1,
bbbbbb
=
bb
⟩
Up:
Monoid enumeration
Prev:
#10060
⟨
a
,
b
|
aa
=1,
bbabbb
=
bb
⟩
Next:
#10273
⟨
a
,
b
|
aa
=1,
ababa
=
bbb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Isomorphic to ℤ
2
∗ ℕ
(6 = 2)
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
b
5
=
b
2
and
b
⋅
b
=
b
2
, however
b
5
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
b
5
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however
b
5
≠
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.
a
2
⇒ 1
[1]
2.
b
6
⇒
b
2
[2]
# ab:aa=1,bbbbbb=bb ab - - aa=1 bbbbbb=bb