#1273 ⟨
a
,
b
|
abbba
=
babb
⟩
Up:
Monoids with two generators and one relation
Prev:
#1272
⟨
a
,
b
|
abbba
=
baab
⟩
Next:
#1274
⟨
a
,
b
|
abbba
=
bbbb
⟩
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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
babb=c
cba
⇒
bc
c
b
2
⇒
a
b
2
c
ca
b
2
⇒
babc
ba
b
2
⇒
c
a
b
3
a
⇒
c
# ab:abbba=babb ac/b babb=c magic:0 cba=bc cbb=abbc cabb=babc babb=c abbba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
