#2625 ⟨
a
,
b
,
c
|
aba
=
b
,
cacc
=1⟩
Up:
Monoid enumeration
Prev:
#2623
⟨
a
,
b
,
c
|
aba
=
b
,
caac
=1⟩
Next:
#2628
⟨
a
,
b
,
c
|
aba
=
b
,
cccc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-commutative monoid
Element
a
has infinite order
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Left-to-right recursive path with deg(
c
) = deg(
a
) = 0,
c
<
a
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ac
⇒
ca
[4]
2.
c
3
a
⇒ 1
[8]
3.
ab
⇒
b
c
3
[9]
4.
c
3
b
⇒
ba
[10]
# abc:aba=b,cacc=1 ca/b - - ac=ca ccca=1 ab=bccc cccb=ba