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