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

#	Rule	Proof
1.	a³baca ⇒ ba	[3]
2.	ca²baca ⇒ bc	[4]
3.	a³bac² ⇒ bc	[9]
4.	b²a ⇒ c	[2]
5.	a³bacba ⇒ c	[5]
6.	b²c ⇒ ca²bacba	[7]
7.	a³bacbc ⇒ ca²bacba	[11]
8.	ba²baca ⇒ a³babc	[6]
9.	bcabaca ⇒ ca(ab)²c	[8]
10.	bca²bac² ⇒ ca²bacbc	[12]
11.	bca²bacba ⇒ ca²bac²	[10]
12.	ba³babc ⇒ cabaca	[13]
13.	bca²bacbc ⇒ (ca²bac)²ba	[14]

# ab:aaababbaa=ba reversed:ac/b bba=c morph:3/0
aaabaca=ba
caabaca=bc
aaabacc=bc
bba=c
aaabacba=c
bbc=caabacba
aaabacbc=caabacba
baabaca=aaababc
bcabaca=caababc
bcaabacc=caabacbc
bcaabacba=caabacc
baaababc=cabaca
bcaabacbc=caabaccaabacba