#13092 ⟨a, b | bab=aaa, abbb=a⟩

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²⁶ ⇒ a²	[9]
2.	a²⁴ba ⇒ ba	[11]
3.	ba⁴ ⇒ a⁴b	[3]
4.	a²b² ⇒ a²³ba	[10]
5.	bab ⇒ a³	[1]
6.	ba²b ⇒ a³ba³	[5]
7.	b²a ⇒ a²¹ba²	[12]
8.	ba³ba ⇒ a⁷ba³b	[6]
9.	ab³ ⇒ a	[2]

# ab:bab=aaa,abbb=a reversed:a/b
aaaaaaaaaaaaaaaaaaaaaaaaaa=aa
aaaaaaaaaaaaaaaaaaaaaaaaba=ba
baaaa=aaaab
aabb=aaaaaaaaaaaaaaaaaaaaaaaba
bab=aaa
baab=aaabaaa
bba=aaaaaaaaaaaaaaaaaaaaabaa
baaaba=aaaaaaabaaab
abbb=a

Up:	Monoids with two generators and two relations
Prev:	#13091 ⟨a, b \| bab=aaa, abba=b⟩
Next:	#13095 ⟨a, b \| bab=aaa, baab=b⟩