#5082 ⟨
a
,
b
|
aaabbaa
=
bbab
⟩
Up:
Monoid enumeration
Prev:
#5081
⟨
a
,
b
|
aaabbaa
=
bbaa
⟩
Next:
#5083
⟨
a
,
b
|
aaabbaa
=
bbba
⟩
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
|
aaabbaab
-1
a
-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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
ab
⇒
a
3
b
2
a
2
[1]
2.
a
3
b
2
a
(
ab
)
2
⇒
b
2
a
4
b
2
a
2
[2]
# ab:aaabbaa=bbab a/b - - bbab=aaabbaa aaabbaabab=bbaaaabbaa