#22836 ⟨a, b | aaa=1, baabb=bba⟩

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³	[13]
2.	b⁸ab ⇒ b²ab	[14]
3.	b²ab³ ⇒ b⁵a	[5]
4.	b³a² ⇒ b⁷ab	[11]
5.	b(ba)² ⇒ b⁴	[3]
6.	(b²a)² ⇒ b⁴ab²	[7]
7.	b²a²b ⇒ b⁶ab²	[8]
8.	ba²b² ⇒ b²a	[2]
9.	a³ ⇒ 1	[1]

# ab:aaa=1,baabb=bba reversed:b/a
bbbbbbbbb=bbb
bbbbbbbbab=bbab
bbabbb=bbbbba
bbbaa=bbbbbbbab
bbaba=bbbb
bbabba=bbbbabb
bbaab=bbbbbbabb
baabb=bba
aaa=1

Up:	Monoids with two generators and two relations
Prev:	#22835 ⟨a, b \| aaa=1, baabb=bab⟩
Next:	#22837 ⟨a, b \| aaa=1, baabb=bbb⟩