#548 ⟨a, b, c | bb=aa, cc=a⟩

Properties

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

# abc:bb=aa,cc=a bc/a - -
cbb=bbc
cccc=bb
a=cc

10 unique, 116 total

Σ	#	Presentation	Properties	φ
7	366	⟨a, b, c \| aba=b, cbc=1⟩	Grp Inf	93
7	938	⟨a, b, c \| aa=b, cbc=b⟩	Can Inf	5
8	2849	⟨a, b, c \| aaa=b, cac=b⟩	Can Inf	2
8	2851	⟨a, b, c \| aaa=b, cbc=a⟩	Can Inf	3
8	3041	⟨a, b, c \| aba=b, cac=b⟩	Can Inf
8	3042	⟨a, b, c \| aba=b, cbc=a⟩	Can Inf	1
8	3472	⟨a, b, c \| ba=ac, cab=a⟩	Can Inf
8	3501	⟨a, b, c \| bb=ac, aaa=c⟩	Can Inf	2
8	3594	⟨a, b, c \| ba=ac, cb=aa⟩	Can Inf
8	6095	⟨a, b, c \| ab=c, bcc=ca⟩	Can Inf

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

1 total

Σ	#	Presentation	Mapping
8	5272	⟨a, b, c \| aa=b, cccc=b⟩	φ(a) = b, φ(b) = bb, φ(c) = c