#3921 ⟨a, b | aaaababba=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. bbba=c
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	b²a ⇒ a⁴bac	[3]
2.	b²c ⇒ ca³bac	[7]
3.	ba⁴bac ⇒ c	[11]
4.	a⁴babc ⇒ c	[5]
5.	(a⁴ba)²c ⇒ ba	[10]
6.	a(a³bac)² ⇒ bc	[8]
7.	ca³babc ⇒ bca³bac	[9]
8.	ca³ba⁵bac ⇒ bc	[4]

# ab:aaaababba=ba ac/b bbba=c morph:4/2
bba=aaaabac
bbc=caaabac
baaaabac=c
aaaababc=c
aaaabaaaaabac=ba
aaaabacaaabac=bc
caaababc=bcaaabac
caaabaaaaabac=bc

Up:	Monoids with two generators and one relation
Prev:	#3920 ⟨a, b \| aaaababba=ab⟩
Next:	#3922 ⟨a, b \| aaaababba=bb⟩