#22284 ⟨a, b | aaa=1, abbbab=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:
- Right-to-left recursive path with deg(b) = 0; deg(a) = 1
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	b²⁶ ⇒ b²	[14]
2.	b²⁴ab² ⇒ ab²	[13]
3.	ab⁵ ⇒ b⁴ab	[4]
4.	ab²ab ⇒ b²¹ab²	[16]
5.	ab³ab ⇒ b²	[2]
6.	ab⁴ab ⇒ b³ab⁴	[6]
7.	a²b² ⇒ b³ab	[3]
8.	abab² ⇒ b⁷(ab)²	[8]
9.	a³ ⇒ 1	[1]
10.	b²(ab)³ ⇒ b¹²ab³	[15]

# ab:aaa=1,abbbab=bb reversed:b/a
bbbbbbbbbbbbbbbbbbbbbbbbbb=bb
bbbbbbbbbbbbbbbbbbbbbbbbabb=abb
abbbbb=bbbbab
abbab=bbbbbbbbbbbbbbbbbbbbbabb
abbbab=bb
abbbbab=bbbabbbb
aabb=bbbab
ababb=bbbbbbbabab
aaa=1
bbababab=bbbbbbbbbbbbabbb

Up:	Monoids with two generators and two relations
Prev:	#22283 ⟨a, b \| aaa=1, abbbab=ba⟩
Next:	#22287 ⟨a, b \| aaa=1, abbbba=bb⟩