#953 ⟨a, b, c | ab=a, aca=a⟩

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 ⋅ b = a and a ⋅ 1 = a, however b ≠ 1
Not right cancellative, because right multiplication by a is not injective:
- ac ⋅ a = a and 1 ⋅ a = a, however ac ≠ 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.	ab ⇒ a	[1]
2.	aca ⇒ a	[2]

# abc:ab=a,aca=a abc - -
ab=a
aca=a

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

3 total

Σ	#	Presentation	Mapping
8	5303	⟨a, b, c \| ab=a, abca=a⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	5315	⟨a, b, c \| ab=a, acab=a⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	5815	⟨a, b, c \| ab=a, aca=ab⟩	φ(a) = a, φ(b) = b, φ(c) = c