#4650 ⟨
a
,
b
|
aabababa
=
bbb
⟩
Up:
Monoids with two generators and one relation
Prev:
#4649
⟨
a
,
b
|
aabababa
=
bba
⟩
Next:
#4651
⟨
a
,
b
|
aabababb
=
aaa
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-commutative monoid
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
(
ba
)
3
⇒
b
3
[1]
2.
b
2
(
ba
)
4
⇒
a
(
ab
)
3
b
3
[2]
# ab:aabababa=bbb ab aabababa=bbb bbbabababa=aabababbbb