#4828 ⟨a, b | abababba=bab⟩

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. ababba=c
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	bab ⇒ abc	[3]
2.	a²bcba ⇒ c	[4]
3.	a²(bc)² ⇒ cabcba	[7]
4.	ba²bc ⇒ abcab	[5]
5.	a(abc)² ⇒ cb	[6]
6.	abca²bc² ⇒ bcb	[9]
7.	b²cb ⇒ abc²a²bc²	[11]
8.	abcab²a ⇒ bc	[8]
9.	abc²ab²a ⇒ b²c	[10]
10.	b³c ⇒ abc³ab²a	[12]
11.	a²bcb²c ⇒ cbcab²a	[13]
12.	abcab²c ⇒ bcabcba	[14]
13.	b²cabc ⇒ (abc²a)²b	[15]

# ab:abababba=bab reversed:ac/b ababba=c morph:6/1
bab=abc
aabcba=c
aabcbc=cabcba
baabc=abcab
aabcabc=cb
abcaabcc=bcb
bbcb=abccaabcc
abcabba=bc
abccabba=bbc
bbbc=abcccabba
aabcbbc=cbcabba
abcabbc=bcabcba
bbcabc=abccaabccab