#23325 ⟨a, b | aaa=1, bbbb=abab⟩

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

#	Rule	Proof
1.	b³⁰ ⇒ b⁶	[12]
2.	bab²⁷ ⇒ bab³	[13]
3.	b²ab²⁶ ⇒ b²ab²	[11]
4.	b⁴ab ⇒ ab⁵	[4]
5.	a²b⁴ ⇒ bab	[3]
6.	(ab)² ⇒ b⁴	[2]
7.	(ab²)² ⇒ b³ab⁵	[5]
8.	(bab)² ⇒ ab⁸	[6]
9.	bab³ab ⇒ ab³ab⁸	[7]
10.	a³ ⇒ 1	[1]
11.	a²b³ab² ⇒ b²ab²³	[10]

# ab:aaa=1,bbbb=abab b/a
bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb=bbbbbb
babbbbbbbbbbbbbbbbbbbbbbbbbbb=babbb
bbabbbbbbbbbbbbbbbbbbbbbbbbbb=bbabb
bbbbab=abbbbb
aabbbb=bab
abab=bbbb
abbabb=bbbabbbbb
babbab=abbbbbbbb
babbbab=abbbabbbbbbbb
aaa=1
aabbbabb=bbabbbbbbbbbbbbbbbbbbbbbbb

Up:	Monoids with two generators and two relations
Prev:	#23320 ⟨a, b \| aaa=1, bbba=abbb⟩
Next:	#23326 ⟨a, b \| aaa=1, bbbb=abba⟩