#7275 ⟨
a
,
b
,
c
|
aa
=1,
bccb
=
bc
⟩
Up:
Monoid enumeration
Prev:
#7274
⟨
a
,
b
,
c
|
aa
=1,
bccb
=
bb
⟩
Next:
#7276
⟨
a
,
b
,
c
|
aa
=1,
bccb
=
cc
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
d
is not injective:
d
⋅
db
=
d
and
d
⋅ 1 =
d
, however
db
≠ 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
Auxiliary generators:
d
=
bcc
Reduction order:
Left-to-right shortlex with
a
<
d
<
c
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
dc
⇒
d
2
[6]
3.
bc
⇒
db
[4]
4.
d
2
b
⇒
d
[5]
# abc:aa=1,bccb=bc adcb bcc=d morph:3/1 aa=1 dc=dd bc=db ddb=d