#1404 ⟨
a
,
b
,
c
|
aa
=1,
abc
=
bc
⟩
Up:
Monoid enumeration
Prev:
#1398
⟨
a
,
b
,
c
|
aa
=1,
abb
=
cc
⟩
Next:
#1405
⟨
a
,
b
,
c
|
aa
=1,
abc
=
ca
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
ab
⋅
c
=
bc
and
b
⋅
c
=
bc
, however
ab
≠
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 shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
abc
⇒
bc
[2]
# abc:aa=1,abc=bc abc - - aa=1 abc=bc