#1780 ⟨
a
,
b
|
ababaabab
=
b
⟩
Up:
Monoids with two generators and one relation
Prev:
#1779
⟨
a
,
b
|
ababaabab
=
a
⟩
Next:
#1781
⟨
a
,
b
|
ababaabba
=
a
⟩
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:
ab
(
aba
)
2
⋅
b
=
b
and 1 ⋅
b
=
b
, however
ab
(
aba
)
2
≠ 1
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
Reduction order:
Left-to-right shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
b
2
⇒
bab
[3]
2.
(
ab
)
3
⇒
ba
(
ab
)
2
[2]
3.
ab
(
aba
)
2
b
⇒
b
[1]
# ab:ababaabab=b ba abb=bab ababab=baabab ababaabab=b