#5493 ⟨a, b, c | ab=c, aaac=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 a is not injective:
- a ⋅ a³b = ab and a ⋅ b = ab, however a³b ≠ b
Not right cancellative, because right multiplication by b is not injective:
- a⁴ ⋅ b = ab and a ⋅ b = ab, however a⁴ ≠ a

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

#	Rule	Proof
1.	a⁴b ⇒ ab	[2]
2.	c ⇒ ab	[1]

# abc:ab=c,aaac=c ab/c - -
aaaab=ab
c=ab

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

1 total

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