#4767 ⟨
a
,
b
|
abaaabab
=
aaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#4766
⟨
a
,
b
|
abaaaaba
=
bbb
⟩
Next:
#4768
⟨
a
,
b
|
abaaabab
=
aab
⟩
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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
a
3
bab
⇒
a
3
[1]
2.
a
6
bab
⇒
a
(
b
a
3
)
2
[2]
# ab:abaaabab=aaa ba abaaabab=aaa aaaaaabab=abaaabaaa