#1326 ⟨a, b, c | ab=1, acca=c⟩

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 ⋅ ba = a and a ⋅ 1 = a, however ba ≠ 1
Not right cancellative, because right multiplication by b is not injective:
- ba ⋅ b = b and 1 ⋅ b = b, however ba ≠ 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(c) = 0, a < c; deg(b) = 1
Certificate: derivations of all rewriting rules from the defining relations.

# abc:ab=1,acca=c ac/b - -
acca=c
ccca=accc
ab=1
cb=acc

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

1 total

Σ	#	Presentation	Mapping
8	6936	⟨a, b, c \| ab=1, acbca=c⟩	φ(a) = a, φ(b) = b, φ(c) = ca