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