#4960 ⟨
a
,
b
|
aaaabaa
=
bbab
⟩
Up:
Monoids with two generators and one relation
Prev:
#4959
⟨
a
,
b
|
aaaabaa
=
bbaa
⟩
Next:
#4961
⟨
a
,
b
|
aaaabaa
=
bbba
⟩
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
ab
⇒
a
4
b
a
2
[1]
2.
a
3
(
aba
)
2
b
⇒
b
2
a
5
b
a
2
[2]
# ab:aaaabaa=bbab a/b bbab=aaaabaa aaaabaabab=bbaaaaabaa