#5513 ⟨a, b, c | ab=c, abaa=c⟩

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

# abc:ab=c,abaa=c ac/b - -
caa=c
ab=c
cb=cac

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

1 total

Σ	#	Presentation	Mapping
8	5703	⟨a, b, c \| aa=b, acb=ac⟩	φ(a) = a, φ(b) = aa, φ(c) = b