#5184 ⟨a, b, c | aa=b, abbc=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.

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

# abc:aa=b,abbc=a ac/b - -
aaaaac=a
b=aa

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

2 total

Σ	#	Presentation	Mapping
8	5222	⟨a, b, c \| aa=b, babc=a⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	5231	⟨a, b, c \| aa=b, bbac=a⟩	φ(a) = a, φ(b) = aa, φ(c) = c