#4281 ⟨a, b | abaabbbba=ba⟩

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:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
Auxiliary generators:
1. bbbbba=c
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	b²a ⇒ aba²c	[3]
2.	b²c ⇒ cba²c	[10]
3.	aba²bc ⇒ baba²c	[5]
4.	cba²bc ⇒ bcba²c	[11]
5.	ba(ba²c)² ⇒ c	[9]
6.	aba³(ba²c)² ⇒ ba	[8]
7.	a(ba²c)³ ⇒ bc	[12]
8.	cba³(ba²c)² ⇒ bc	[4]

# ab:abaabbbba=ba ac/b bbbbba=c morph:6/2
bba=abaac
bbc=cbaac
abaabc=babaac
cbaabc=bcbaac
babaacbaac=c
abaaabaacbaac=ba
abaacbaacbaac=bc
cbaaabaacbaac=bc

Up:	Monoids with two generators and one relation
Prev:	#4280 ⟨a, b \| abaabbbba=ab⟩
Next:	#4282 ⟨a, b \| abaabbbba=bb⟩