#28273 ⟨
a
,
b
|
aa
=1,
babbb
=
bbab
⟩
Up:
Monoids with two generators and two relations
Prev:
#28271
⟨
a
,
b
|
aa
=1,
babbb
=
babb
⟩
Next:
#28275
⟨
a
,
b
|
aa
=1,
babbb
=
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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
ba
b
3
⇒
b
2
ab
[2]
# ab:aa=1,babbb=bbab ab aa=1 babbb=bbab