#4925 ⟨a, b | aaaaaba=baba⟩

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

#	Rule	Proof
1.	a⁵c² ⇒ ca⁵c	[11]
2.	a¹⁰c ⇒ c²	[8]
3.	(a⁵c)² ⇒ c³	[12]
4.	cba ⇒ a⁵c	[6]
5.	a⁵ba ⇒ c	[2]
6.	cbc ⇒ a⁵ca⁴ba	[10]
7.	a⁵bc ⇒ ca⁴ba	[7]
8.	bac ⇒ a⁵c	[13]
9.	ba⁶c ⇒ c²	[9]
10.	(ba)² ⇒ c	[3]
11.	babc ⇒ ca⁴ba	[5]

# ab:aaaaaba=baba reversed:ac/b baba=c magic:0
aaaaacc=caaaaac
aaaaaaaaaac=cc
aaaaacaaaaac=ccc
cba=aaaaac
aaaaaba=c
cbc=aaaaacaaaaba
aaaaabc=caaaaba
bac=aaaaac
baaaaaac=cc
baba=c
babc=caaaaba

Up:	Monoids with two generators and one relation
Prev:	#4924 ⟨a, b \| aaaaaba=baab⟩
Next:	#4926 ⟨a, b \| aaaaaba=babb⟩