#848 ⟨
a
,
b
|
abababab
=
a
⟩
Up:
Monoid enumeration
Prev:
#847
⟨
a
,
b
|
ababaaab
=
b
⟩
Next:
#849
⟨
a
,
b
|
abababba
=
a
⟩
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
⋅
ab
=
aba
and
a
⋅
ba
=
aba
, however
ab
≠
ba
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
2
b
⇒
aba
[2]
2.
(
ab
)
4
⇒
a
[1]
# ab:abababab=a ba - - aab=aba abababab=a