#1672 ⟨
a
,
b
,
c
|
aab
=
ba
,
cbc
=1⟩
Up:
Monoid enumeration
Prev:
#1671
⟨
a
,
b
,
c
|
aab
=
ba
,
cbb
=1⟩
Next:
#1673
⟨
a
,
b
,
c
|
aab
=
ba
,
cca
=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(
a
) = 0; deg(
b
) = deg(
c
) = 1,
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
⇒
ba
[1]
2.
cb
⇒
bc
[3]
3.
a
c
2
⇒
c
2
a
2
[7]
4.
b
c
2
⇒ 1
[4]
# abc:aab=ba,cbc=1 a/bc - - aab=ba cb=bc acc=ccaa bcc=1