#4496 ⟨
a
,
b
|
aaabaaba
=
bab
⟩
Up:
Monoids with two generators and one relation
Prev:
#4495
⟨
a
,
b
|
aaabaaba
=
baa
⟩
Next:
#4497
⟨
a
,
b
|
aaabaaba
=
bba
⟩
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
(
a
2
b
)
2
a
⇒
bab
[1]
2.
a
3
b
a
2
b
2
ab
⇒
b
(
aba
)
3
[2]
# ab:aaabaaba=bab ba aaabaaba=bab aaabaabbab=babaabaaba