#3473 ⟨
a
,
b
|
aaababbaba
=
b
⟩
Up:
Monoids with two generators and one relation
Prev:
#3472
⟨
a
,
b
|
aaababbaba
=
a
⟩
Next:
#3474
⟨
a
,
b
|
aaababbabb
=
a
⟩
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
b
(
a
b
2
)
2
⇒
b
a
2
(
bab
)
2
a
[2]
2.
a
3
(
bab
)
2
a
⇒
b
[1]
# ab:aaababbaba=b ba aaababbabb=baababbaba aaababbaba=b