#25705 ⟨
a
,
b
|
aa
=
a
,
babb
=
abab
⟩
Up:
Monoids with two generators and two relations
Prev:
#25699
⟨
a
,
b
|
aa
=
a
,
baba
=
abbb
⟩
Next:
#25706
⟨
a
,
b
|
aa
=
a
,
babb
=
abba
⟩
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
⇒
a
[1]
2.
ba
b
2
⇒ (
ab
)
2
[2]
3.
b
(
ab
)
3
⇒ (
ab
)
3
[3]
# ab:aa=a,babb=abab ab aa=a babb=abab bababab=ababab