#6034 ⟨
a
,
b
,
c
|
ab
=
c
,
aca
=
ac
⟩
Up:
Monoid enumeration
Prev:
#6030
⟨
a
,
b
,
c
|
ab
=
c
,
abc
=
cb
⟩
Next:
#6035
⟨
a
,
b
,
c
|
ab
=
c
,
aca
=
ba
⟩
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
d
is not injective:
d
⋅
a
=
d
and
d
⋅ 1 =
d
, however
a
≠ 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
=
ac
Reduction order:
Left-to-right shortlex with
a
<
d
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
ab
⇒
c
[1]
2.
ac
⇒
d
[3]
3.
da
⇒
d
[5]
4.
db
⇒
d
2
[7]
5.
dc
⇒
d
2
[8]
# abc:ab=c,aca=ac adbc ac=d morph:2/1 ab=c ac=d da=d db=dd dc=dd