⟨a, b | aababbbbbba=1⟩

Up:

Monoids with two generators and one relation

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:
- Right-to-left recursive path with deg(c) = deg(d) = deg(a) = 0, c < d < a; deg(b) = 1
Auxiliary generators:
1. aaa=c
2. babbbbbb=d
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	dc ⇒ 1	[10]
2.	cd ⇒ 1	[8]
3.	ca ⇒ ac	[5]
4.	da ⇒ ad	[9]
5.	a³ ⇒ c	[2]
6.	bcba ⇒ cbab	[20]
7.	baba² ⇒ d(bc)²	[19]
8.	bab²a² ⇒ db(bc)²	[21]
9.	bab³a² ⇒ db³cbc	[22]
10.	bab⁴a² ⇒ db⁴cbc	[23]
11.	b⁶c ⇒ a²bab⁵	[14]
12.	bab⁵d ⇒ adb⁶	[11]
13.	b⁶ac ⇒ a²bab⁵a	[16]
14.	bab⁵ad ⇒ adb⁶a	[12]
15.	b⁶a² ⇒ a²db⁵cb	[28]
16.	bab⁵a² ⇒ db⁵cbc	[26]
17.	bab⁶ ⇒ d	[3]

# ab:aababbbbbba=1 reversed:cda/b aaa=c,babbbbbb=d magic:0 dc=1 cd=1 ca=ac da=ad aaa=c bcba=cbab babaa=dbcbc babbaa=dbbcbc babbbaa=dbbbcbc babbbbaa=dbbbbcbc bbbbbbc=aababbbbb babbbbbd=adbbbbbb bbbbbbac=aababbbbba babbbbbad=adbbbbbba bbbbbbaa=aadbbbbbcb babbbbbaa=dbbbbbcbc babbbbbb=d

Up:	Monoids with two generators and one relation
Prev:	#3093 ⟨a, b \| aababbbbbab=1⟩
Next:	#3098 ⟨a, b \| aabbaaaabab=1⟩

#3094 ⟨a, b | aababbbbbba=1⟩

Quick links

Properties

Rewriting system