#5353 ⟨
a
,
b
|
ababaab
=
bbba
⟩
Up:
Monoid enumeration
Prev:
#5352
⟨
a
,
b
|
ababaab
=
bbab
⟩
Next:
#5354
⟨
a
,
b
|
ababaab
=
bbbb
⟩
Contents
Properties
Rewriting system
Other submonoids of same group
Properties
Sum of relation sides is 11
Infinite cancellative non-commutative monoid
Element
a
has infinite order
Submonoid of enveloping group: ⟨
a
,
b
|
aaabab
-1
a
-1
bbb
⟩
Embedding:
φ
(
a
) =
ab
,
φ
(
b
) =
b
-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(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
3
a
⇒ (
ab
)
2
a
2
b
[1]
# ab:ababaab=bbba reversed:a/b - - bbba=ababaab
Other submonoids of same group
1 unique, 1 total
Σ
#
Presentation
Properties
10
1929
⟨
a
,
b
|
aaabbbab
=
ba
⟩
Can
Inf