#1272 ⟨
a
,
b
|
abbba
=
baab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1271
⟨
a
,
b
|
abbba
=
abbb
⟩
Next:
#1273
⟨
a
,
b
|
abbba
=
babb
⟩
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:
baab=c
cab
⇒
a
b
2
c
c
b
2
a
⇒
bac
c
b
3
a
⇒
a
b
3
c
a
b
3
a
⇒
c
b
a
2
b
⇒
c
c
a
2
b
⇒
b
a
2
c
# ab:abbba=baab bc/a baab=c magic:0 cab=abbc cbba=bac cbbba=abbbc abbba=c baab=c caab=baac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
