#1050 ⟨
a
,
b
|
aaabba
=
aab
⟩
Up:
Monoid enumeration
Prev:
#1049
⟨
a
,
b
|
aaabba
=
aaa
⟩
Next:
#1051
⟨
a
,
b
|
aaabba
=
aba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
2
b
2
a
=
a
2
b
and
a
⋅
ab
=
a
2
b
, however
a
2
b
2
a
≠
ab
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
=
aab
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.
a
2
b
⇒
c
[2]
2.
acba
⇒
c
[4]
3.
cab
⇒
acbc
[5]
4.
c
2
ba
⇒
acbc
[6]
# ab:aaabba=aab ac/b aab=c magic:0 aab=c acba=c cab=acbc ccba=acbc