#549 ⟨
a
,
b
|
ababa
=
bab
⟩
Up:
Monoids with two generators and one relation
Prev:
#548
⟨
a
,
b
|
ababa
=
abb
⟩
Next:
#550
⟨
a
,
b
|
ababa
=
bbb
⟩
Properties
Presentation has sum-of-sides 8
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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
bab=c
aca
⇒
c
c
2
a
⇒
a
c
2
cb
⇒
abac
cab
⇒
bac
bab
⇒
c
# ab:ababa=bab ac/b bab=c magic:0 aca=c cca=acc cb=abac cab=bac bab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
