#144 ⟨
a
,
b
|
aababab
=1⟩
Up:
Monoid enumeration
Prev:
#142
⟨
a
,
b
|
aabaabb
=1⟩
Next:
#145
⟨
a
,
b
|
aababba
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
(
ba
)
3
=
a
and
a
⋅ 1 =
a
, however
a
(
ba
)
3
≠ 1
Not right cancellative, because right multiplication by (
ab
)
3
is not injective:
a
(
ba
)
3
⋅ (
ab
)
3
= (
ab
)
3
and 1 ⋅ (
ab
)
3
= (
ab
)
3
, however
a
(
ba
)
3
≠ 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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
(
ab
)
3
⇒ 1
[1]
# ab:aababab=1 ab - - aababab=1