#260 ⟨
a
,
b
|
abab
=
aab
⟩
Up:
Monoids with two generators and one relation
Prev:
#259
⟨
a
,
b
|
abab
=
aaa
⟩
Next:
#261
⟨
a
,
b
|
abab
=
aba
⟩
Properties
Presentation has sum-of-sides 7
Infinite non-commutative monoid
Complete 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 recursive path with deg(
b
) = 0; deg(
c
) = deg(
a
) = 1,
c
<
a
Auxiliary generator:
aab=c
ac
⇒
cab
abc
⇒
cab
a
2
b
⇒
c
(
ab
)
2
⇒
c
# ab:abab=aab b/ca aab=c magic:0 ac=cab abc=cab aab=c abab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
