#10322 ⟨
a
,
b
|
aa
=1,
babab
=
bab
⟩
Up:
Monoids with two generators and two relations
Prev:
#10303
⟨
a
,
b
|
aa
=1,
abbbb
=
bbb
⟩
Next:
#10323
⟨
a
,
b
|
aa
=1,
babab
=
bbb
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
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.
b
(
ab
)
2
⇒
bab
[2]
# ab:aa=1,babab=bab ab aa=1 babab=bab