#3983 ⟨
a
,
b
|
baab
=
aa
,
bbbb
=1⟩
Up:
Monoid enumeration
Prev:
#3979
⟨
a
,
b
|
abbb
=
ab
,
bbbb
=1⟩
Next:
#3991
⟨
a
,
b
|
baba
=
ba
,
bbaa
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-commutative monoid
Element
a
has infinite order
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(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
4
⇒ 1
[2]
2.
b
a
2
⇒
a
2
b
3
[3]
# ab:baab=aa,bbbb=1 b/a - - bbbb=1 baa=aabbb