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

#	Rule	Proof
1.	a³ ⇒ 1	[1]
2.	b²a ⇒ aba²b	[2]
3.	(ba²)² ⇒ a²b²	[4]
4.	b(aba)² ⇒ abab²	[5]
5.	ba(ab)²a² ⇒ (a²b)²b	[8]
6.	ba²(ba)³ ⇒ (ab)³b	[9]
7.	(ba)⁴ab ⇒ (ab)⁴b	[11]
8.	(ba)⁴b² ⇒ a(ab)⁴b²	[12]

# ab:aaa=1,abaab=bba reversed:a/b
aaa=1
bba=abaab
baabaa=aabb
babaaba=ababb
baababaa=aabaabb
baabababa=abababb
babababaab=ababababb
bababababb=aababababbb

Up:	Monoids with two generators and two relations
Prev:	#22327 ⟨a, b \| aaa=1, bbbbbb=bb⟩
Next:	#22787 ⟨a, b \| aaa=1, abaab=bbb⟩