#884 ⟨
a
,
b
|
aaaabaa
=
ba
⟩
Up:
Monoid enumeration
Prev:
#883
⟨
a
,
b
|
aaaabaa
=
ab
⟩
Next:
#885
⟨
a
,
b
|
aaaabaa
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
a
is not injective:
a
4
ba
⋅
a
=
ba
and
b
⋅
a
=
ba
, however
a
4
ba
≠
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
Auxiliary generators:
c
=
ba
Reduction order:
Left-to-right recursive path with deg(
c
) = deg(
a
) = 0,
c
<
a
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
c
2
⇒
c
a
3
ca
[6]
2.
a
4
ca
⇒
c
[4]
3.
bc
⇒
c
a
3
ca
[5]
4.
ba
⇒
c
[2]
# ab:aaaabaa=ba ca/b ba=c magic:0 aaaacc=caaaca aaaaca=c bc=caaaca ba=c