#2486 ⟨a, b, c | aab=c, aacc=1⟩

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(a²b)²a = a and a ⋅ 1 = a, however a(a²b)²a ≠ 1
Not right cancellative, because right multiplication by a(a²b)² is not injective:
- a(a²b)²a ⋅ a(a²b)² = a(a²b)² and 1 ⋅ a(a²b)² = a(a²b)², however a(a²b)²a ≠ 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(b) = 0, a < b; deg(c) = 1
Certificate: derivations of all rewriting rules from the defining relations.

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

# abc:aab=c,aacc=1 ab/c - -
aaaabaab=1
c=aab

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

1 total

Σ	#	Presentation	Mapping
8	4739	⟨a, b, c \| aa=b, bbcbc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = b