#2360 ⟨
a
,
b
|
abbbbba
=
abb
⟩
Up:
Monoids with two generators and one relation
Prev:
#2359
⟨
a
,
b
|
abbbbba
=
aba
⟩
Next:
#2361
⟨
a
,
b
|
abbbbba
=
bab
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
5
a
=
a
b
2
and
a
⋅
b
2
=
a
b
2
, however
b
5
a
≠
b
2
Enveloping group is isomorphic to ℤ
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
1
1
Auxiliary generators:
c
=
abbbb
Reduction order:
Left-to-right shortlex with
c
<
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
c
b
2
⇒
cbc
[5]
2.
a
b
2
⇒
cba
[3]
3.
(
cb
)
2
a
⇒
c
[4]
# ab:abbbbba=abb cba abbbb=c morph:5/1 cbb=cbc abb=cba cbcba=c