#5522 ⟨
a
,
b
,
c
|
ab
=
c
,
abbc
=
a
⟩
Up:
Monoid enumeration
Prev:
#5521
⟨
a
,
b
,
c
|
ab
=
c
,
abba
=
c
⟩
Next:
#5524
⟨
a
,
b
,
c
|
ab
=
c
,
abbc
=
c
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
bcb
=
c
and
c
⋅ 1 =
c
, however
bcb
≠ 1
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(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
c
2
b
⇒
cbc
[4]
2.
(
cb
)
2
⇒
c
[3]
3.
a
⇒
cbc
[2]
# abc:ab=c,abbc=a bc/a - - ccb=cbc cbcb=c a=cbc