#4694 ⟨
a
,
b
|
aaab
=
b
,
bbaa
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#4692
⟨
a
,
b
|
aaab
=
b
,
babb
=
b
⟩
Next:
#4696
⟨
a
,
b
|
aaab
=
b
,
bbab
=
b
⟩
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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
bab
⇒
b
3
[3]
2.
b
a
2
⇒
b
3
[7]
3.
b
4
⇒
b
[6]
4.
a
3
b
⇒
b
[1]
# ab:aaab=b,bbaa=b ba bab=bbb baa=bbb bbbb=b aaab=b