#86 ⟨a, b, c | aa=a, bbc=1⟩

Properties

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

#	Rule	Proof
1.	a² ⇒ a	[1]
2.	b²c ⇒ 1	[2]

# abc:aa=a,bbc=1 abc - -
aa=a
bbc=1

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

1 total

Σ	#	Presentation	Mapping
8	1619	⟨a, b, c \| aab=ab, bbc=1⟩	φ(a) = a, φ(b) = b, φ(c) = c