#4771 ⟨a, b | abaaabab=baa⟩

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

#	Rule	Proof
1.	ba² ⇒ c	[2]
2.	c²(ab)² ⇒ bac	[5]
3.	ac(ab)² ⇒ c	[4]
4.	acabac ⇒ ca²	[6]
5.	baca² ⇒ c²abac	[7]
6.	ca⁴ ⇒ acac²abac	[11]
7.	ca³bab ⇒ acabc	[8]
8.	ca³bac ⇒ acabca²	[9]
9.	(c²aba)²c ⇒ b(ac)²a²	[10]

# ab:abaaabab=baa bc/a baa=c magic:0
baa=c
ccabab=bac
acabab=c
acabac=caa
bacaa=ccabac
caaaa=acaccabac
caaabab=acabc
caaabac=acabcaa
ccabaccabac=bacacaa

Up:	Monoids with two generators and one relation
Prev:	#4770 ⟨a, b \| abaaabab=abb⟩
Next:	#4772 ⟨a, b \| abaaabab=bab⟩