#2312 ⟨
a
,
b
|
abaabab
=
bbb
⟩
Up:
Monoids with two generators and one relation
Prev:
#2311
⟨
a
,
b
|
abaabab
=
bba
⟩
Next:
#2313
⟨
a
,
b
|
abaabba
=
aaa
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not right cancellative, because right multiplication by
b
is not injective:
(
aba
)
2
⋅
b
=
b
3
and
b
2
⋅
b
=
b
3
, however (
aba
)
2
≠
b
2
Enveloping group: ⟨
a
,
b
|
aaabbabb
⟩
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
Reduction order:
Left-to-right shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
aba
)
2
b
⇒
b
3
[1]
2.
ab
a
2
b
4
⇒
b
3
a
(
ab
)
2
[2]
# ab:abaabab=bbb ba abaabab=bbb abaabbbb=bbbaabab