#1233 ⟨
a
,
b
|
aabba
=
baba
⟩
Up:
Monoids with two generators and one relation
Prev:
#1232
⟨
a
,
b
|
aabba
=
baab
⟩
Next:
#1234
⟨
a
,
b
|
aabba
=
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(
a
) = 0; deg(
c
) = deg(
b
) = 1,
c
<
b
Auxiliary generator:
baba=c
bac
⇒
cba
a
2
bc
⇒
cba
(
ba
)
2
⇒
c
a
2
b
2
a
⇒
c
babc
⇒
ca
b
2
a
a
2
b
2
c
⇒
ca
b
2
a
# ab:aabba=baba a/cb baba=c magic:0 bac=cba aabc=cba baba=c aabba=c babc=cabba aabbc=cabba
Right Cayley graph (truncated)
Left Cayley graph (truncated)
