#463 ⟨
a
,
b
|
aabbba
=
ba
⟩
Up:
Monoids with two generators and one relation
Prev:
#462
⟨
a
,
b
|
aabbba
=
ab
⟩
Next:
#464
⟨
a
,
b
|
aabbba
=
bb
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 8
Infinite non-cancellative non-commutative monoid
Not right cancellative, because right multiplication by
a
is not injective:
a
2
b
3
⋅
a
=
ba
and
b
⋅
a
=
ba
, however
a
2
b
3
≠
b
Enveloping group: ⟨
a
,
b
|
aabb
⟩
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
=
bbba
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
a
(
ac
)
3
⇒
c
[4]
2.
ba
⇒
a
2
c
[3]
3.
bc
⇒
cac
[5]
# ab:aabbba=ba ac/b bbba=c morph:4/1 aacacac=c ba=aac bc=cac