#20151 ⟨
a
,
b
|
aab
=
b
,
bbaa
=
bbb
⟩
Up:
Monoids with two generators and two relations
Prev:
#20150
⟨
a
,
b
|
aab
=
b
,
bbaa
=
bba
⟩
Next:
#20156
⟨
a
,
b
|
aab
=
b
,
bbab
=
baa
⟩
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
2
b
⇒
b
[1]
2.
b
2
a
4
⇒
b
2
a
2
[3]
3.
b
3
⇒
b
2
a
2
[2]
# ab:aab=b,bbaa=bbb a/b aab=b bbaaaa=bbaa bbb=bbaa