#25895 ⟨
a
,
b
|
ab
=
a
,
bbba
=
bbaa
⟩
Up:
Monoids with two generators and two relations
Prev:
#25891
⟨
a
,
b
|
ab
=
a
,
bbba
=
baaa
⟩
Next:
#25897
⟨
a
,
b
|
ab
=
a
,
bbbb
=
aaaa
⟩
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.
ab
⇒
a
[1]
2.
a
3
⇒
a
2
[3]
3.
b
3
a
⇒
b
2
a
2
[2]
# ab:ab=a,bbba=bbaa ab ab=a aaa=aa bbba=bbaa