#26679 ⟨
a
,
b
|
aa
=1,
bababbab
=
b
⟩
Up:
Monoid enumeration
Prev:
#26677
⟨
a
,
b
|
aa
=1,
babababb
=
b
⟩
Next:
#26681
⟨
a
,
b
|
aa
=1,
bababbbb
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅ (
ab
)
3
b
=
b
and
b
⋅ 1 =
b
, however (
ab
)
3
b
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
b
(
ab
)
3
⋅
b
=
b
and 1 ⋅
b
=
b
, however
b
(
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
b
2
ab
⇒
ba
b
2
[4]
3.
(
ba
)
3
b
2
⇒
b
[5]
# ab:aa=1,bababbab=b ab - - aa=1 bbab=babb babababb=b