#3615 ⟨a, b, c | aaa=1, abbbc=1⟩

Properties

Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element b has infinite order
Not left cancellative, because left multiplication by b is not injective:
- b ⋅ (b²cb)³ = b and b ⋅ 1 = b, however (b²cb)³ ≠ 1
Not right cancellative, because right multiplication by b²c(b³c)² is not injective:
- (b²cb)³ ⋅ b²c(b³c)² = b²c(b³c)² and 1 ⋅ b²c(b³c)² = b²c(b³c)², however (b²cb)³ ≠ 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(b) = deg(c) = 0, b < c; deg(a) = 1
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	(b³c)³ ⇒ 1	[6]
2.	a ⇒ (b³c)²	[5]

# abc:aaa=1,abbbc=1 bc/a - -
bbbcbbbcbbbc=1
a=bbbcbbbc

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

1 total

Σ	#	Presentation	Mapping
8	4142	⟨a, b, c \| aaa=1, bbbc=a⟩	φ(a) = bbbc, φ(b) = b, φ(c) = c