#11076 ⟨
a
,
b
|
baab
=
aba
,
bbbb
=1⟩
Up:
Monoids with two generators and two relations
Prev:
#11074
⟨
a
,
b
|
baab
=
aab
,
bbbb
=1⟩
Next:
#11114
⟨
a
,
b
|
aaaaa
=
a
,
bbbbb
=1⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-commutative monoid
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
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
⇒
aba
b
3
[3]
3.
b
3
aba
⇒
a
2
b
[4]
# ab:baab=aba,bbbb=1 b/a bbbb=1 baa=ababbb bbbaba=aab