#3494 ⟨
a
,
b
,
c
|
bb
=
aa
,
cac
=
a
⟩
Up:
Monoid enumeration
Prev:
#3493
⟨
a
,
b
,
c
|
bb
=
aa
,
acc
=
c
⟩
Next:
#3495
⟨
a
,
b
,
c
|
bb
=
aa
,
cac
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite cancellative 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
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
⇒
a
2
[1]
2.
b
a
2
⇒
a
2
b
[3]
3.
c
a
2
⇒
a
2
c
[4]
4.
cac
⇒
a
[2]
# abc:bb=aa,cac=a abc - - bb=aa baa=aab caa=aac cac=a