#5498 ⟨
a
,
b
|
aaaaba
=
bbbab
⟩
Up:
Monoid enumeration
Prev:
#5497
⟨
a
,
b
|
aaaaba
=
bbbaa
⟩
Next:
#5499
⟨
a
,
b
|
aaaaba
=
bbbba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite cancellative non-commutative monoid
Element
a
has infinite order
Submonoid of enveloping group: ⟨
a
,
b
|
aaaabab
-1
a
-1
b
-1
b
-1
b
-1
⟩
Embedding:
φ
(
a
) =
a
,
φ
(
b
) =
b
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
4
ba
⇒
b
3
ab
[1]
2.
b
3
ab
a
3
ba
⇒
a
4
b
4
ab
[2]
# ab:aaaaba=bbbab ab - - aaaaba=bbbab bbbabaaaba=aaaabbbbab