#14585 ⟨
a
,
b
|
aaba
=
a
,
bbaaa
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#14584
⟨
a
,
b
|
aaba
=
a
,
babbb
=
b
⟩
Next:
#14589
⟨
a
,
b
|
aaba
=
a
,
bbaba
=
a
⟩
Properties
Presentation has sum-of-sides 11
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:
ba=c
a
2
c
⇒
a
aca
⇒
a
cac
⇒
c
c
2
a
⇒
c
ba
⇒
c
bc
⇒
a
c
2
# ab:aaba=a,bbaaa=a ac/b ba=c frequency:2/1 aac=a aca=a cac=c cca=c ba=c bc=acc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
