#4033 ⟨
a
,
b
|
aaabbabba
=
bb
⟩
Up:
Monoid enumeration
Prev:
#4032
⟨
a
,
b
|
aaabbabba
=
ba
⟩
Next:
#4034
⟨
a
,
b
|
aaabbbaaa
=
aa
⟩
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
|
aaabbabbab
-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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
(
b
2
a
)
2
⇒
b
2
[1]
2.
a
3
b
2
a
b
4
⇒
b
2
a
2
(
b
2
a
)
2
[2]
# ab:aaabbabba=bb ba - - aaabbabba=bb aaabbabbbb=bbaabbabba