#7054 ⟨a, b, c | ab=1, bcacc=c⟩

Properties

Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element a has infinite order
Not left cancellative, because left multiplication by a is not injective:
- a ⋅ ba = a and a ⋅ 1 = a, however ba ≠ 1
Not right cancellative, because right multiplication by b is not injective:
- ba ⋅ b = b and 1 ⋅ b = b, however ba ≠ 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

Auxiliary generators:
1. d = ac
Reduction order:
- Left-to-right recursive path with deg(d) = deg(b) = 0, d < b; deg(c) = deg(a) = 1, c < a
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

# abc:ab=1,bcacc=c db/ca ac=d morph:2/0
bddd=ddbd
bddbd=d
c=bd
ad=ddbd
ab=1

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

1 total

Σ	#	Presentation	Mapping
8	7069	⟨a, b, c \| ab=1, bccbc=c⟩	φ(a) = a, φ(b) = b, φ(c) = d