#1986 ⟨a, b | aaa=a, aabb=a⟩

Properties

Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element aba has infinite order
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ a² = a and a ⋅ 1 = a, however a² ≠ 1
Not right cancellative, because right multiplication by a is not injective:
- a² ⋅ a = a and 1 ⋅ a = a, however a² ≠ 1

Format:	Pretty Plain
Word:
	Enter a word above to compute its normal form. Tips: Lowercase letters stand for generators. Spaces are ignored. Numbers repeat the previous letter, e.g. `b90`.
Strategy:	Leftmost Rightmost
Result:	1 1

#	Rule	Proof
1.	a³ ⇒ a	[1]
2.	ab² ⇒ a²	[3]

# ab:aaa=a,aabb=a ab - -
aaa=a
abb=aa

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

7 total

Σ	#	Presentation	Mapping
11	12152	⟨a, b \| aaaa=aa, aabb=a⟩	φ(a) = a, φ(b) = b
11	12244	⟨a, b \| aaab=ab, aabb=a⟩	φ(a) = a, φ(b) = b
11	14695	⟨a, b \| aabb=a, abbbb=a⟩	φ(a) = a, φ(b) = b
11	18694	⟨a, b \| aaa=a, aaaabb=a⟩	φ(a) = a, φ(b) = b
11	19243	⟨a, b \| aaa=a, aaabb=aa⟩	φ(a) = a, φ(b) = b
11	19779	⟨a, b \| aaa=a, aaaa=abb⟩	φ(a) = a, φ(b) = b
11	19798	⟨a, b \| aaa=a, aabb=aaa⟩	φ(a) = a, φ(b) = b

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

1 total

Σ	#	Presentation	Mapping
11	12262	⟨a, b \| aaab=ab, bbaa=a⟩	φ(a) = a, φ(b) = b