#2717 ⟨
a
,
b
|
abbba
=
aabab
⟩
Up:
Monoid enumeration
Prev:
#2716
⟨
a
,
b
|
abbba
=
aabaa
⟩
Next:
#2718
⟨
a
,
b
|
abbba
=
aabba
⟩
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
⋅
b
3
a
=
a
(
ab
)
2
and
a
⋅ (
ab
)
2
=
a
(
ab
)
2
, however
b
3
a
≠ (
ab
)
2
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
(
ab
)
2
⇒
a
b
3
a
[1]
# ab:abbba=aabab ba - - aabab=abbba