#5850 ⟨
a
,
b
,
c
|
ab
=
a
,
bab
=
cc
⟩
Up:
Monoid enumeration
Prev:
#5849
⟨
a
,
b
,
c
|
ab
=
a
,
bab
=
cb
⟩
Next:
#5851
⟨
a
,
b
,
c
|
ab
=
a
,
bac
=
aa
⟩
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
a
is not injective:
a
⋅
b
=
a
and
a
⋅ 1 =
a
, however
b
≠ 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 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.
ab
⇒
a
[1]
2.
a
2
c
⇒
acba
[4]
3.
bac
⇒
cba
[3]
4.
c
2
⇒
ba
[2]
# abc:ab=a,bab=cc ab/c - - ab=a aac=acba bac=cba cc=ba