#3581 ⟨
a
,
b
,
c
|
ac
=
ab
,
cc
=
bb
⟩
Up:
Monoid enumeration
Prev:
#3580
⟨
a
,
b
,
c
|
ac
=
ab
,
cb
=
bc
⟩
Next:
#3582
⟨
a
,
b
,
c
|
ba
=
ab
,
bb
=
ac
⟩
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
=
ab
and
a
⋅
b
=
ab
, however
c
≠
b
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
) = deg(
b
) = 0,
a
<
b
; deg(
c
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ac
⇒
ab
[1]
2.
abc
⇒
a
b
2
[3]
3.
b
2
c
⇒
c
b
2
[4]
4.
c
2
⇒
b
2
[2]
# abc:ac=ab,cc=bb ab/c - - ac=ab abc=abb bbc=cbb cc=bb