⟨a, b | aabaabbabba=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:
- Left-to-right recursive path with deg(c) = deg(b) = deg(d) = 0, c < b < d; deg(a) = 1
Auxiliary generators:
1. baabba=c
2. aaacb=d
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	bd ⇒ 1	[36]
2.	db ⇒ 1	[8]
3.	cacbc ⇒ acb²	[49]
4.	dacbc ⇒ ba	[13]
5.	b²a ⇒ acbc	[12]
6.	cacbac ⇒ a²cb(bc)²d²	[59]
7.	ba² ⇒ ca²c	[40]
8.	bad²ac ⇒ ca²d	[47]
9.	dacbac ⇒ ca²c²bcd²	[55]
10.	bca² ⇒ acbcd²acb	[53]
11.	dca² ⇒ ad²acb	[48]
12.	a³c ⇒ d²	[37]
13.	ca(ac)² ⇒ d	[41]
14.	cac²a²c² ⇒ a²cb(bc)²ad²	[63]
15.	bad²a²c ⇒ ca²bad²	[52]
16.	da(ac)² ⇒ ca²cad	[44]
17.	dac²a²c² ⇒ ca²c²bcad²	[61]
18.	c(a²c)² ⇒ bad²	[42]
19.	d(a²c)² ⇒ ca²cabad²	[51]

# ab:aabaabbabba=1 cbd/a baabba=c,aaacb=d morph:6/0,5/0 bd=1 db=1 cacbc=acbb dacbc=ba bba=acbc cacbac=aacbbcbcdd baa=caac baddac=caad dacbac=caaccbcdd bcaa=acbcddacb dcaa=addacb aaac=dd caacac=d caccaacc=aacbbcbcadd baddaac=caabadd daacac=caacad daccaacc=caaccbcadd caacaac=badd daacaac=caacabadd

Up:	Monoids with two generators and one relation
Prev:	#3045 ⟨a, b \| aabaabbabab=1⟩
Next:	#3047 ⟨a, b \| aabaabbbaab=1⟩

#3046 ⟨a, b | aabaabbabba=1⟩

Quick links

Properties

Rewriting system