#3455 ⟨
a
,
b
|
aaababaaab
=
a
⟩
Up:
Monoid enumeration
Prev:
#3454
⟨
a
,
b
|
aaabaabbba
=
b
⟩
Next:
#3456
⟨
a
,
b
|
aaababaaab
=
b
⟩
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
a
is not injective:
a
⋅
a
(
ab
)
2
a
3
b
=
a
and
a
⋅ 1 =
a
, however
a
(
ab
)
2
a
3
b
≠ 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
Reduction order:
Left-to-right shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
(
ba
)
2
⇒
a
2
b
a
3
b
[2]
2.
a
4
b
a
2
b
⇒ (
a
2
ba
)
2
[4]
3.
a
(
ab
a
2
)
2
b
⇒
a
[3]
# ab:aaababaaab=a ba - - aaababa=aabaaab aaaabaab=aabaaaba aabaaabaab=a