#5714 ⟨
a
,
b
,
c
|
aa
=
b
,
acc
=
bb
⟩
Up:
Monoid enumeration
Prev:
#5708
⟨
a
,
b
,
c
|
aa
=
b
,
acb
=
cb
⟩
Next:
#5717
⟨
a
,
b
,
c
|
aa
=
b
,
acc
=
cb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
c
2
=
a
4
and
a
⋅
a
3
=
a
4
, however
c
2
≠
a
3
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.
b
⇒
a
2
[1]
2.
a
c
2
⇒
a
4
[2]
# abc:aa=b,acc=bb a/bc - - b=aa acc=aaaa