#775 ⟨a, b, c | ab=a, aaac=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 ⋅ b = a and a ⋅ 1 = a, however b ≠ 1
Not right cancellative, because right multiplication by a²c is not injective:
- a²ca ⋅ a²c = a²c and 1 ⋅ a²c = a²c, however a²ca ≠ 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.	a³c ⇒ 1	[2]

# abc:ab=a,aaac=1 abc - -
ab=a
aaac=1

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

3 total

Σ	#	Presentation	Mapping
8	4773	⟨a, b, c \| ab=a, aaabc=1⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	4777	⟨a, b, c \| ab=a, aabac=1⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	4791	⟨a, b, c \| ab=a, abaac=1⟩	φ(a) = a, φ(b) = b, φ(c) = c