#16263 ⟨
a
,
b
|
aab
=
ba
,
bbab
=
ba
⟩
Up:
Monoids with two generators and two relations
Prev:
#16262
⟨
a
,
b
|
aab
=
ba
,
bbab
=
ab
⟩
Next:
#16264
⟨
a
,
b
|
aab
=
ba
,
bbab
=
bb
⟩
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:
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.
a
4
b
⇒
a
2
b
[4]
2.
ba
⇒
a
2
b
[1]
3.
a
2
b
3
⇒
a
2
b
[5]
# ab:aab=ba,bbab=ba reversed:a/b aaaab=aab ba=aab aabbb=aab