#1933 ⟨
a
,
b
|
aaabbbba
=
ba
⟩
Up:
Monoids with two generators and one relation
Prev:
#1932
⟨
a
,
b
|
aaabbbba
=
ab
⟩
Next:
#1934
⟨
a
,
b
|
aaabbbba
=
bb
⟩
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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
bbbba=c
a
(
a
2
c
)
4
⇒
c
ba
⇒
a
3
c
bc
⇒
c
a
2
c
# ab:aaabbbba=ba ac/b bbbba=c frequency:5/0 aaacaacaacaac=c ba=aaac bc=caac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
