#12192 ⟨
a
,
b
|
aaaa
=
ab
,
bbba
=
a
⟩
Up:
Monoid enumeration
Prev:
#12190
⟨
a
,
b
|
aaaa
=
ab
,
bbab
=
a
⟩
Next:
#12194
⟨
a
,
b
|
aaaa
=
ab
,
bbbb
=
a
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
=
a
4
and
a
⋅
a
3
=
a
4
, however
b
≠
a
3
Not right cancellative, because right multiplication by
a
is not injective:
b
3
⋅
a
=
a
and 1 ⋅
a
=
a
, however
b
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
11
⇒
a
2
[3]
2.
ab
⇒
a
4
[1]
3.
b
3
a
⇒
a
[2]
# ab:aaaa=ab,bbba=a a/b - - aaaaaaaaaaa=aa ab=aaaa bbba=a