#275 ⟨a, b, c | aaa=b, bbc=1⟩

Properties

Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element a has infinite order
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ a⁵ca = a and a ⋅ 1 = a, however a⁵ca ≠ 1
Not right cancellative, because right multiplication by a⁵c is not injective:
- a⁵ca ⋅ a⁵c = a⁵c and 1 ⋅ a⁵c = a⁵c, however a⁵ca ≠ 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 ⇒ 1	[2]
2.	b ⇒ a³	[1]

# abc:aaa=b,bbc=1 ac/b - -
aaaaaac=1
b=aaa

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

7 total

Σ	#	Presentation	Mapping
7	762	⟨a, b, c \| aa=b, bbbc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4663	⟨a, b, c \| aa=b, aabbc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4677	⟨a, b, c \| aa=b, ababc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4681	⟨a, b, c \| aa=b, abbac=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4716	⟨a, b, c \| aa=b, baabc=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4719	⟨a, b, c \| aa=b, babac=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c
8	4729	⟨a, b, c \| aa=b, bbaac=1⟩	φ(a) = a, φ(b) = aa, φ(c) = c