#5247 ⟨a, b, c | aa=b, bcbc=a⟩

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³c² = a and a ⋅ 1 = a, however a³c² ≠ 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:aa=b,bcbc=a ac/b - -
aaca=aaac
aaaacc=a
b=aa

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

1 total

Σ	#	Presentation	Mapping
8	5537	⟨a, b, c \| ab=c, acac=a⟩	φ(a) = a, φ(b) = c, φ(c) = ac