#4107 ⟨a, b | bab=aaa, bbbb=1⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 10
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by d is not injective:
-
d ⋅ da2 = d and d ⋅ 1 = d, however da2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
da2 ⋅ a = a and 1 ⋅ a = a, however da2 ≠ 1
- Auxiliary generators:
- c = bbb
- d = caacaacaac
- Reduction order:
- Left-to-right recursive path with deg(d) = deg(a) = 0, d < a; deg(c) = 1; deg(b) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:bab=aaa,bbbb=1 da/c/b bbb=c,caacaacaac=d morph:3/0,10/0
ad=da
ddaa=d
daaa=a
dcdaa=dc
acdaa=ac
ddc=cdd
aac=dcaaaa
ddac=acdd
cdac=dda
dccdaa=dcc
acc=cdcaaaaaaa
acdc=dccdda
cccd=daca
ccca=dacaaaa
cdcdc=acdddddda
dccc=acda
cccc=1
b=ccc
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 10 | 5719 | ⟨a, b | aaaa=1, abbba=b⟩ | φ(a) = c, φ(b) = a |