#5145 ⟨
a
,
b
|
aabaaba
=
bbaa
⟩
Up:
Monoid enumeration
Prev:
#5144
⟨
a
,
b
|
aabaaba
=
babb
⟩
Next:
#5146
⟨
a
,
b
|
aabaaba
=
bbab
⟩
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
a
is not injective:
(
a
2
b
)
2
⋅
a
=
b
2
a
2
and
b
2
a
⋅
a
=
b
2
a
2
, however (
a
2
b
)
2
≠
b
2
a
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:
Right-to-left recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
a
2
⇒ (
a
2
b
)
2
a
[1]
# ab:aabaaba=bbaa reversed:a/b - - bbaa=aabaaba