#5146 ⟨
a
,
b
,
c
|
aa
=
a
,
bbbc
=
a
⟩
Up:
Monoid enumeration
Prev:
#5144
⟨
a
,
b
,
c
|
aa
=
a
,
bacc
=
c
⟩
Next:
#5147
⟨
a
,
b
,
c
|
aa
=
a
,
bbbc
=
b
⟩
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
b
is not injective:
b
⋅
b
2
c
b
3
c
=
b
3
c
and
b
⋅
b
2
c
=
b
3
c
, however
b
2
c
b
3
c
≠
b
2
c
Not right cancellative, because right multiplication by
c
is not injective:
b
3
c
b
3
⋅
c
=
b
3
c
and
b
3
⋅
c
=
b
3
c
, however
b
3
c
b
3
≠
b
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(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
b
3
c
)
2
⇒
b
3
c
[4]
2.
a
⇒
b
3
c
[2]
# abc:aa=a,bbbc=a bc/a - - bbbcbbbc=bbbc a=bbbc