#895 ⟨a, b, c | aa=a, bbc=a⟩

Properties

Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element b has infinite order
Not left cancellative, because left multiplication by b is not injective:
- b ⋅ bcb²c = b²c and b ⋅ bc = b²c, however bcb²c ≠ bc
Not right cancellative, because right multiplication by c is not injective:
- b²cb² ⋅ c = b²c and b² ⋅ c = b²c, however b²cb² ≠ b²

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.

#	Rule	Proof
1.	(b²c)² ⇒ b²c	[4]
2.	a ⇒ b²c	[2]

# abc:aa=a,bbc=a bc/a - -
bbcbbc=bbc
a=bbc

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

1 total

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