#1697 ⟨
a
,
b
|
bab
=
ab
,
bbb
=
b
⟩
Up:
Monoid enumeration
Prev:
#1695
⟨
a
,
b
|
bab
=
aa
,
bbb
=
b
⟩
Next:
#1699
⟨
a
,
b
|
bab
=
bb
,
bbb
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
b
2
=
c
and
c
⋅ 1 =
c
, however
b
2
≠ 1
Not right cancellative, because right multiplication by
c
is not injective:
b
⋅
c
=
c
and 1 ⋅
c
=
c
, however
b
≠ 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
Auxiliary generators:
c
=
ab
Reduction order:
Left-to-right shortlex with
c
<
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
ac
⇒
c
2
[6]
2.
ab
⇒
c
[3]
3.
bc
⇒
c
[5]
4.
c
b
2
⇒
c
[7]
5.
b
3
⇒
b
[2]
# ab:bab=ab,bbb=b cab ab=c morph:2/1 ac=cc ab=c bc=c cbb=c bbb=b