#4067 ⟨
a
,
b
|
aabaaaaba
=
ba
⟩
Up:
Monoid enumeration
Prev:
#4066
⟨
a
,
b
|
aabaaaaba
=
ab
⟩
Next:
#4068
⟨
a
,
b
|
aabaaaaba
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
a
4
ca
⋅
c
=
c
and 1 ⋅
c
=
c
, however
a
4
ca
≠ 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
=
ba
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
a
3
c
⇒
a
(
ac
)
2
[6]
2.
a
4
cac
⇒
c
[8]
3.
ba
⇒
c
[2]
4.
bc
⇒
a
(
ac
)
3
[7]
# ab:aabaaaaba=ba ac/b ba=c magic:0 caaac=aacac aaaacac=c ba=c bc=aacacac