#14465 ⟨
a
,
b
|
aaab
=
a
,
bbbaa
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#14463
⟨
a
,
b
|
aaab
=
a
,
bbabb
=
a
⟩
Next:
#14467
⟨
a
,
b
|
aaab
=
a
,
bbbab
=
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
6
⇒
a
[12]
2.
ab
⇒
a
4
[11]
3.
b
3
a
⇒
a
5
[13]
# ab:aaab=a,bbbaa=a a/b aaaaaa=a ab=aaaa bbba=aaaaa