#4459 ⟨
a
,
b
,
c
|
aba
=1,
bccb
=
c
⟩
Up:
Monoid enumeration
Prev:
#4456
⟨
a
,
b
,
c
|
aba
=1,
bcbc
=
c
⟩
Next:
#4462
⟨
a
,
b
,
c
|
aba
=1,
bccc
=
c
⟩
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 shortlex with
b
<
a
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
⇒
ba
[3]
2.
b
a
2
⇒ 1
[4]
3.
c
a
2
⇒
b
c
2
[5]
4.
c
2
b
⇒
a
2
c
[7]
# abc:aba=1,bccb=c bac - - ab=ba baa=1 caa=bcc ccb=aac