#884 ⟨
a
,
b
|
aaaabaa
=
ba
⟩
Up:
Monoids with two generators and one relation
Prev:
#883
⟨
a
,
b
|
aaaabaa
=
ab
⟩
Next:
#885
⟨
a
,
b
|
aaaabaa
=
bb
⟩
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(
c
) = deg(
a
) = 0,
c
<
a
; deg(
b
) = 1
Auxiliary generator:
ba=c
a
4
c
2
⇒
c
a
3
ca
a
4
ca
⇒
c
bc
⇒
c
a
3
ca
ba
⇒
c
# ab:aaaabaa=ba ca/b ba=c magic:0 aaaacc=caaaca aaaaca=c bc=caaaca ba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
