#1118 ⟨
a
,
b
|
ababab
=
aab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1117
⟨
a
,
b
|
ababab
=
aaa
⟩
Next:
#1119
⟨
a
,
b
|
ababab
=
aba
⟩
Properties
Presentation has sum-of-sides 9
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
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Auxiliary generator:
aab=c
cab
⇒
abc
cac
⇒
a
c
2
a
2
b
⇒
c
a
2
c
⇒
ab
c
2
abac
⇒
c
2
(
ab
)
2
c
⇒
ac
(
ab
)
3
⇒
c
# ab:ababab=aab bc/a aab=c magic:0 cab=abc cac=acc aab=c aac=abcc abac=cc ababc=ac ababab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
