#5851 ⟨
a
,
b
|
abaaba
=
ababb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5850
⟨
a
,
b
|
abaaba
=
ababa
⟩
Next:
#5852
⟨
a
,
b
|
abaaba
=
abbab
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
a
2
ba
=
aba
b
2
and
a
⋅
ba
b
2
=
aba
b
2
, however
b
a
2
ba
≠
ba
b
2
Enveloping group: ⟨
a
,
b
|
aaabb
⟩
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(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
aba
b
2
⇒ (
aba
)
2
[1]
# ab:abaaba=ababb a/b ababb=abaaba