#4993 ⟨
a
,
b
|
aaaabba
=
bbba
⟩
Up:
Monoids with two generators and one relation
Prev:
#4992
⟨
a
,
b
|
aaaabba
=
bbab
⟩
Next:
#4994
⟨
a
,
b
|
aaaabba
=
bbbb
⟩
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
3
a
⇒
a
4
b
2
a
[1]
# ab:aaaabba=bbba a/b bbba=aaaabba