#5111 ⟨a, b | aaabbba=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 shortlex with b < a < c
Auxiliary generators:
1. baba=c
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	bac ⇒ cba	[4]
2.	(ba)² ⇒ c	[2]
3.	a³b²c ⇒ cba	[6]
4.	ca²b²c ⇒ babcba	[8]
5.	a³b³a ⇒ c	[3]
6.	ca²b³a ⇒ babc	[7]
7.	a³b³c ⇒ babc	[10]
8.	(bab)²c ⇒ ca²b³c	[9]
9.	a³b⁴abc ⇒ ca²b³c	[11]
10.	ca²b⁴abc ⇒ babca²b³c	[12]

# ab:aaabbba=baba reversed:bac baba=c magic:0
bac=cba
baba=c
aaabbc=cba
caabbc=babcba
aaabbba=c
caabbba=babc
aaabbbc=babc
babbabc=caabbbc
aaabbbbabc=caabbbc
caabbbbabc=babcaabbbc

Up:	Monoids with two generators and one relation
Prev:	#5110 ⟨a, b \| aaabbba=baab⟩
Next:	#5112 ⟨a, b \| aaabbba=babb⟩