#4343 ⟨a, b | abbabaaab=bb⟩

Quick links

Properties
Rewriting system

Properties

Presentation has sum-of-sides 11
Infinite non-commutative monoid

Rewriting system

Format:	Pretty Plain
Word to reduce:
	Tips: Lowercase letters stand for generators. Spaces are ignored. Numbers repeat the previous letter, e.g. `b90`.
Reduction strategy:	Leftmost Rightmost
Path to normal form:	1 1

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

#	Rule	Proof
1.	a(bc)² ⇒ b²cac	[8]
2.	abcac ⇒ bc	[5]
3.	bab²c ⇒ cbc(ac)²	[10]
4.	abcb² ⇒ b²cab	[6]
5.	abcab ⇒ b²	[3]
6.	bab³ ⇒ cb(ca)²b	[9]
7.	b(ab)²c ⇒ cbcac	[7]
8.	b(acbc)² ⇒ cbcab²cac	[14]
9.	baba² ⇒ c	[2]
10.	bacbc(ac)² ⇒ cbcabc	[11]
11.	(ba)²b² ⇒ cbcab	[4]
12.	bacbcacb² ⇒ c(bcab)²	[13]
13.	bacb(ca)²b ⇒ cbcab²	[12]

# ab:abbabaaab=bb c/ba babaa=c morph:5/2
abcbc=bbcac
abcac=bc
babbc=cbcacac
abcbb=bbcab
abcab=bb
babbb=cbcacab
bababc=cbcac
bacbcacbc=cbcabbcac
babaa=c
bacbcacac=cbcabc
bababb=cbcab
bacbcacbb=cbcabbcab
bacbcacab=cbcabb