#1274 ⟨
a
,
b
,
c
|
aa
=1,
bccb
=
c
⟩
Up:
Monoid enumeration
Prev:
#1273
⟨
a
,
b
,
c
|
aa
=1,
bccb
=
b
⟩
Next:
#1277
⟨
a
,
b
,
c
|
ab
=1,
aaac
=
a
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-commutative monoid
Element
ba
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
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
b
c
2
b
⇒
c
[2]
3.
c
3
b
⇒
b
c
3
[3]
# abc:aa=1,bccb=c abc - - aa=1 bccb=c cccb=bccc