#1767 ⟨
a
,
b
|
abaababab
=
a
⟩
Up:
Monoid enumeration
Prev:
#1763
⟨
a
,
b
|
abaabaaab
=
a
⟩
Next:
#1768
⟨
a
,
b
|
abaababab
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
ba
(
ab
)
3
=
a
and
a
⋅ 1 =
a
, however
ba
(
ab
)
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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
(
ab
)
3
⇒ (
aba
)
2
ba
[2]
2.
aba
(
ab
)
3
⇒
a
[1]
# ab:abaababab=a ba - - aaababab=abaababa abaababab=a