#6683 ⟨a, b, c | aa=1, abcba=c⟩

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(b) = deg(a) = 0, b < a; deg(c) = 1
Certificate: derivations of all rewriting rules from the defining relations.

# abc:aa=1,abcba=c ba/c - -
aa=1
ac=bcba
abcb=ca

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

2 total

Σ	#	Presentation	Mapping
8	7185	⟨a, b, c \| aa=1, abcb=ca⟩	φ(a) = a, φ(b) = b, φ(c) = c
8	7683	⟨a, b, c \| aa=1, bcb=aca⟩	φ(a) = a, φ(b) = b, φ(c) = c