#6093 ⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
bb
⟩
Up:
Monoid enumeration
Prev:
#6092
⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
ba
⟩
Next:
#6095
⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
ca
⟩
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
b
is not injective:
b
⋅ (
ab
)
2
=
b
2
and
b
⋅
b
=
b
2
, however (
ab
)
2
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
(
ba
)
2
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however (
ba
)
2
≠
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.
b
2
ab
⇒
ba
b
2
[3]
2.
b
(
ab
)
2
⇒
b
2
[2]
3.
c
⇒
ab
[1]
# abc:ab=c,bcc=bb ab/c - - bbab=babb babab=bb c=ab