#25209 ⟨a, b | aa=a, abbba=abb⟩

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

Auxiliary generators:
1. c = abbbbbbbb
Reduction order:
- Left-to-right recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	a² ⇒ a	[1]
2.	ac ⇒ c	[7]
3.	ca ⇒ c	[14]
4.	cba ⇒ c	[16]
5.	cbc ⇒ c²	[17]
6.	ab²a ⇒ ab²	[4]
7.	cb² ⇒ ab²c	[9]
8.	ab³a ⇒ ab²	[2]
9.	ab³c ⇒ ab²c	[10]
10.	ab⁴a ⇒ ab⁴	[6]
11.	ab⁵a ⇒ ab⁴	[5]
12.	ab⁵c ⇒ ab⁴c	[11]
13.	ab⁶a ⇒ ab⁶	[12]
14.	ab⁷a ⇒ ab⁶	[13]
15.	ab⁷c ⇒ ab⁶c	[15]
16.	ab⁸ ⇒ c	[3]

# ab:aa=a,abbba=abb ac/b abbbbbbbb=c morph:9/0
aa=a
ac=c
ca=c
cba=c
cbc=cc
abba=abb
cbb=abbc
abbba=abb
abbbc=abbc
abbbba=abbbb
abbbbba=abbbb
abbbbbc=abbbbc
abbbbbba=abbbbbb
abbbbbbba=abbbbbb
abbbbbbbc=abbbbbbc
abbbbbbbb=c