#933 ⟨a, b, c | aa=b, bcc=c⟩

Properties

Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element a has infinite order
Not right cancellative, because right multiplication by c is not injective:
- a²c ⋅ c = c and 1 ⋅ c = c, 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.

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

# abc:aa=b,bcc=c ac/b - -
aacc=c
b=aa

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

4 total

Σ	#	Presentation	Mapping
7	1029	⟨a, b, c \| ab=c, acc=b⟩	φ(a) = a, φ(b) = acc, φ(c) = c
8	5177	⟨a, b, c \| aa=b, aacc=c⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	5500	⟨a, b, c \| ab=c, aabc=b⟩	φ(a) = a, φ(b) = acc, φ(c) = c
8	5571	⟨a, b, c \| ab=c, bbaa=a⟩	φ(a) = c, φ(b) = a, φ(c) = ca