#12955 ⟨
a
,
b
|
aba
=
aab
,
babb
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#12954
⟨
a
,
b
|
aba
=
aab
,
babb
=
a
⟩
Next:
#12956
⟨
a
,
b
|
aba
=
aab
,
bbaa
=
a
⟩
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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
⇒
aba
[1]
2.
ba
b
2
⇒
b
[2]
3.
(
ab
)
3
⇒
aba
[3]
# ab:aba=aab,babb=b ba aab=aba babb=b ababab=aba