#24168 ⟨
a
,
b
|
aa
=
a
,
bababbb
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#24167
⟨
a
,
b
|
aa
=
a
,
bababab
=
b
⟩
Next:
#24169
⟨
a
,
b
|
aa
=
a
,
bababbb
=
b
⟩
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.
a
b
15
⇒
a
[16]
2.
ba
⇒
a
b
6
[14]
3.
a
2
⇒
a
[1]
# ab:aa=a,bababbb=a b/a abbbbbbbbbbbbbbb=a ba=abbbbbb aa=a