#4759 ⟨
a
,
b
|
abaaaaab
=
bba
⟩
Up:
Monoids with two generators and one relation
Prev:
#4758
⟨
a
,
b
|
abaaaaab
=
bab
⟩
Next:
#4760
⟨
a
,
b
|
abaaaaab
=
bbb
⟩
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:
Right-to-left recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
a
⇒
ab
a
5
b
[1]
# ab:abaaaaab=bba reversed:a/b bba=abaaaaab