#2581 ⟨
a
,
b
|
abaaba
=
aaba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2580
⟨
a
,
b
|
abaaba
=
aaab
⟩
Next:
#2582
⟨
a
,
b
|
abaaba
=
aabb
⟩
Properties
Presentation has sum-of-sides 10
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:
aaba=c
c
2
bc
⇒
cb
c
2
c
(
bc
)
2
⇒
c
2
ac
⇒
cbc
abc
⇒
c
caba
⇒
cbc
a
2
ba
⇒
c
# ab:abaaba=aaba bc/a aaba=c magic:0 ccbc=cbcc cbcbc=cc ac=cbc abc=c caba=cbc aaba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
