#4864 ⟨
a
,
b
|
abbaabba
=
abb
⟩
Up:
Monoid enumeration
Prev:
#4863
⟨
a
,
b
|
abbaabba
=
aba
⟩
Next:
#4865
⟨
a
,
b
|
abbaabba
=
bab
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
aca
=
c
and
c
⋅ 1 =
c
, however
aca
≠ 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:
c
=
abb
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
c
2
a
⇒
cac
[6]
2.
(
ca
)
2
⇒
c
[4]
3.
a
b
2
⇒
c
[2]
4.
c
b
2
⇒
ca
c
2
[5]
# ab:abbaabba=abb ac/b abb=c magic:0 cca=cac caca=c abb=c cbb=cacc