#16056 ⟨a, b | aaa=bb, aabb=aa⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element ba has infinite order
- Not left cancellative, because left multiplication by c is not injective:
-
c ⋅ c3 = c and c ⋅ 1 = c, however c3 ≠ 1
- Not right cancellative, because right multiplication by c is not injective:
-
c3 ⋅ c = c and 1 ⋅ c = c, however c3 ≠ 1
- Auxiliary generators:
- c = aa
- Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(a) = 1; deg(b) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaa=bb,aabb=aa c/a/b aa=c morph:2/0
cccc=c
ac=ccc
ca=ccc
aa=c
cbccc=cb
cba=cbcc
cccb=bccc
abc=ccbc
bb=ccc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 16064 | ⟨a, b | aaa=bb, abba=aa⟩ | φ(a) = a, φ(b) = b |