#5705 ⟨
a
,
b
|
aaaa
=1,
aabab
=
b
⟩
Up:
Monoid enumeration
Prev:
#5694
⟨
a
,
b
|
aaaa
=1,
aaaaa
=
a
⟩
Next:
#5709
⟨
a
,
b
|
aaaa
=1,
aabbb
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
a
2
b
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
a
3
b
=
b
and
b
⋅ 1 =
b
, however
a
3
b
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
b
a
3
⋅
b
=
b
and 1 ⋅
b
=
b
, however
b
a
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.
bab
⇒
a
2
b
[3]
2.
a
4
⇒ 1
[1]
3.
b
a
3
b
⇒
b
[4]
# ab:aaaa=1,aabab=b ab - - bab=aab aaaa=1 baaab=b