#1041 ⟨a, b, c | ab=c, bca=c⟩

Properties

Sum of relation sides is 7
Infinite cancellative non-commutative monoid
Element a has infinite order
Submonoid of enveloping group: ⟨a, b | aaba^-1b^-1⟩
- Embedding: φ(a) = ab, φ(b) = b^-1, φ(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(c) = 0, a < c; deg(b) = 1
Certificate: derivations of all rewriting rules from the defining relations.

# abc:ab=c,bca=c ac/b - -
cca=ac
bca=c
ab=c
cb=bcc

6 unique, 24 total

Σ	#	Presentation	Properties	φ
7	417	⟨a, b, c \| abc=b, cba=1⟩	Grp Inf	10
7	537	⟨a, b, c \| ba=ac, bb=c⟩	Can Inf	4
7	554	⟨a, b, c \| bb=ac, ca=b⟩	Can Inf	3
8	5567	⟨a, b, c \| ab=c, baca=c⟩	Can Inf
8	5675	⟨a, b, c \| aa=b, aac=ca⟩	Can Inf	1
8	6101	⟨a, b, c \| ab=c, cac=ba⟩	Can Inf

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

2 total

Σ	#	Presentation	Mapping
8	5561	⟨a, b, c \| ab=c, baba=c⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	6084	⟨a, b, c \| ab=c, bca=ab⟩	φ(a) = a, φ(b) = b, φ(c) = c