#4011 ⟨a, b, c | abc=1, abaca=1⟩

Properties

Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element a has infinite order
Not left cancellative, because left multiplication by b is not injective:
- b ⋅ cab = b and b ⋅ 1 = b, however cab ≠ 1
Not right cancellative, because right multiplication by c is not injective:
- cab ⋅ c = c and 1 ⋅ c = c, however cab ≠ 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(b) = deg(c) = 0, b < c; deg(a) = 1
Certificate: derivations of all rewriting rules from the defining relations.

# abc:abc=1,abaca=1 bc/a - -
abc=1
bac=bcbc
bca=1

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

1 total

Σ	#	Presentation	Mapping
8	4060	⟨a, b, c \| abc=1, bacaa=1⟩	φ(a) = a, φ(b) = b, φ(c) = c