#1241 ⟨a, b, c | aa=1, abca=b⟩

Properties

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.	a² ⇒ 1	[1]
2.	bc ⇒ aba	[4]

# abc:aa=1,abca=b ab/c - -
aa=1
bc=aba

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

2 total

Σ	#	Presentation	Mapping
7	1392	⟨a, b, c \| aa=1, aba=bc⟩	φ(a) = a, φ(b) = b, φ(c) = c
7	1402	⟨a, b, c \| aa=1, abc=ba⟩	φ(a) = a, φ(b) = b, φ(c) = c