#17157 ⟨
a
,
b
|
aaaa
=1,
bbabbb
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#17156
⟨
a
,
b
|
aaaa
=1,
bbabbb
=
a
⟩
Next:
#17159
⟨
a
,
b
|
aaaa
=1,
bbbbbb
=
b
⟩
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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
⇒ 1
[1]
2.
b
2
ab
⇒
ba
b
2
[6]
3.
ba
b
4
⇒
b
[4]
# ab:aaaa=1,bbabbb=b ab aaaa=1 bbab=babb babbbb=b