#12266 ⟨
a
,
b
|
aaab
=
ab
,
bbba
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#12265
⟨
a
,
b
|
aaab
=
ab
,
bbab
=
b
⟩
Next:
#12267
⟨
a
,
b
|
aaab
=
ab
,
bbba
=
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
⇒
a
2
[3]
2.
a
3
b
⇒
ab
[1]
3.
b
3
a
⇒
a
[2]
# ab:aaab=ab,bbba=a ab aaaa=aa aaab=ab bbba=a