#979 ⟨
a
,
b
|
abaabba
=
ab
⟩
Up:
Monoids with two generators and one relation
Prev:
#978
⟨
a
,
b
|
abaabba
=
aa
⟩
Next:
#980
⟨
a
,
b
|
abaabba
=
ba
⟩
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:
abb=c
c
2
a
⇒
cac
(
ca
)
2
⇒
c
abca
⇒
abac
abaca
⇒
ab
cb
⇒
aba
c
2
a
b
2
⇒
c
# ab:abaabba=ab ac/b abb=c frequency:3/0 cca=cac caca=c abca=abac abaca=ab cb=abacc abb=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
