#339 ⟨a, b, c | aab=c, cbb=1⟩

Properties

Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element a has infinite order
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ ab³a = a and a ⋅ 1 = a, however ab³a ≠ 1
Not right cancellative, because right multiplication by ab³ is not injective:
- ab³a ⋅ ab³ = ab³ and 1 ⋅ ab³ = ab³, however ab³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

Reduction order:
- Left-to-right recursive path with deg(a) = deg(b) = 0, a < b; deg(c) = 1
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	a²b³ ⇒ 1	[2]
2.	c ⇒ a²b	[1]

# abc:aab=c,cbb=1 ab/c - -
aabbb=1
c=aab

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

5 total

Σ	#	Presentation	Mapping
7	768	⟨a, b, c \| aa=b, bccc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = b
7	1330	⟨a, b, c \| ab=1, accc=b⟩	φ(a) = a, φ(b) = abbb, φ(c) = b
8	4675	⟨a, b, c \| aa=b, aaccc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = b
8	4956	⟨a, b, c \| ab=a, ccaaa=1⟩	φ(a) = b, φ(b) = 1, φ(c) = a
8	5069	⟨a, b, c \| ab=c, bbaaa=1⟩	φ(a) = b, φ(b) = a, φ(c) = ba