#3465 ⟨a, b, c | ba=ac, bbb=c⟩

Properties

Sum of relation sides is 8
Infinite cancellative non-commutative monoid
Element a has infinite order
Submonoid of enveloping group: ⟨a, b | aaaba^-1b^-1⟩
- Embedding: φ(a) = b^-1, φ(b) = b^-1ab, φ(c) = a

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.	ab³ ⇒ ba	[3]
2.	c ⇒ b³	[2]

# abc:ba=ac,bbb=c ab/c - -
abbb=ba
c=bbb

5 unique, 13 total

Σ	#	Presentation	Properties	φ
8	1997	⟨a, b, c \| abc=bb, cba=1⟩	Grp Inf	5
8	3439	⟨a, b, c \| ba=ac, aab=c⟩	Can Inf	3
8	3540	⟨a, b, c \| bb=ac, cba=b⟩	Can Inf
8	5592	⟨a, b, c \| ab=c, bcca=c⟩	Can Inf
8	6110	⟨a, b, c \| ab=c, ccc=ba⟩	Can Inf

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

1 total

Σ	#	Presentation	Mapping
8	5556	⟨a, b, c \| ab=c, baaa=c⟩	φ(a) = b, φ(b) = a, φ(c) = ba