⟨a, b | aaa=1, bbbbb=aba⟩

Up:

Monoids with two generators and two relations

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

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

#	Rule	Proof
1.	bd ⇒ db	[26]
2.	d²b³ ⇒ d	[37]
3.	db⁴ ⇒ b	[19]
4.	dcdb³ ⇒ dc	[41]
5.	bcdb³ ⇒ bc	[38]
6.	d²c ⇒ cd²	[42]
7.	d²bc ⇒ bcd²	[43]
8.	b³c ⇒ dcb⁶	[50]
9.	d²b²c ⇒ b²cd²	[44]
10.	c²d ⇒ db²cb²	[40]
11.	c²b ⇒ db²cb⁶	[48]
12.	cdbc ⇒ bcd⁴b	[53]
13.	cdb²c ⇒ d²b	[34]
14.	dc² ⇒ b²cdb²	[39]
15.	bc² ⇒ cb⁵	[11]
16.	(bc)² ⇒ cdcb¹⁷	[56]
17.	b²cdc ⇒ dcbcd⁴b	[54]
18.	c³ ⇒ 1	[8]
19.	c(dc)² ⇒ bcb²cd¹⁰b	[60]
20.	a ⇒ c²	[7]

# ab:aaa=1,bbbbb=aba db/c/a aa=c,cbbbbcbbbbcb=d morph:2/0,12/0 bd=db ddbbb=d dbbbb=b dcdbbb=dc bcdbbb=bc ddc=cdd ddbc=bcdd bbbc=dcbbbbbb ddbbc=bbcdd ccd=dbbcbb ccb=dbbcbbbbbb cdbc=bcddddb cdbbc=ddb dcc=bbcdbb bcc=cbbbbb bcbc=cdcbbbbbbbbbbbbbbbbb bbcdc=dcbcddddb ccc=1 cdcdc=bcbbcddddddddddb a=cc

Up:	Monoids with two generators and two relations
Prev:	#22857 ⟨a, b \| aaa=1, bbabb=bbb⟩
Next:	#22861 ⟨a, b \| aaa=1, bbbbb=abb⟩

#22860 ⟨a, b | aaa=1, bbbbb=aba⟩

Quick links

Properties

Rewriting system