#5048 ⟨
a
,
b
|
aaababa
=
babb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5047
⟨
a
,
b
|
aaababa
=
baba
⟩
Next:
#5049
⟨
a
,
b
|
aaababa
=
bbaa
⟩
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
3
(
ba
)
2
⇒
ba
b
2
[1]
2.
a
3
b
(
a
b
2
)
2
⇒
ba
b
2
a
2
(
ba
)
2
[2]
# ab:aaababa=babb ba aaababa=babb aaababbabb=babbaababa