#5339 ⟨
a
,
b
|
ababaab
=
aaaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#5338
⟨
a
,
b
|
abaabba
=
bbbb
⟩
Next:
#5340
⟨
a
,
b
|
ababaab
=
aaab
⟩
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
)
2
a
2
b
⇒
a
4
[1]
2.
a
5
b
a
2
b
⇒ (
ab
)
2
a
5
[2]
# ab:ababaab=aaaa ba ababaab=aaaa aaaaabaab=ababaaaaa