#5486 ⟨
a
,
b
|
aaaaba
=
baaab
⟩
Up:
Monoids with two generators and one relation
Prev:
#5485
⟨
a
,
b
|
aaaaba
=
baaaa
⟩
Next:
#5487
⟨
a
,
b
|
aaaaba
=
baaba
⟩
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.
a
4
ba
⇒
b
a
3
b
[1]
2.
a
4
b
2
a
3
b
⇒
b
(
a
3
b
)
2
a
[2]
# ab:aaaaba=baaab ba aaaaba=baaab aaaabbaaab=baaabaaaba