#3390 ⟨a, b | aaaababbaa=a⟩
Contents
- Properties
- Rewriting system
- Isomorphic instances
- Sum of relation sides is 11
- Infinite non-cancellative non-commutative monoid
- Element a has infinite order
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ a3bab2a2 = a and a ⋅ 1 = a, however a3bab2a2 ≠ 1
- Not right cancellative, because right multiplication by a is not injective:
-
a4bab2a ⋅ a = a and 1 ⋅ a = a, however a4bab2a ≠ 1
- Reduction order:
- Left-to-right shortlex with a < b
- Certificate: derivations of all rewriting rules from the defining relations.
| # | Rule | Proof |
| 1. |
abab2a2 ⇒ a2bab2a |
[3] |
| 2. |
a5bab2a ⇒ a |
[4] |
# ab:aaaababbaa=a ab - -
ababbaa=aababba
aaaaababba=a
The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.
1 total
| Σ | # | Presentation | Mapping |
| 11 | 3468 | ⟨a, b | aaababbaaa=a⟩ | φ(a) = a, φ(b) = b |