#1971 ⟨a, b | aababbaa=ba⟩

Properties

Presentation has sum-of-sides 10
Infinite non-commutative monoid

Complete 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(c) = 0; deg(a) = deg(b) = 1, a < b
Auxiliary generator: ba=c

ba ⇒ c
b²c ⇒ cacbc²
cacbca ⇒ bc
a²cbc² ⇒ bc
(cac)²bc² ⇒ bc²bca
cac(bc)² ⇒ bcacbc²
a²cbca ⇒ c
a²c²acbc² ⇒ c²bca
a²c(bc)² ⇒ cacbc²

# ab:aababbaa=ba reversed:c/ab ba=c magic:0
ba=c
bbc=cacbcc
cacbca=bc
aacbcc=bc
caccacbcc=bccbca
cacbcbc=bcacbcc
aacbca=c
aaccacbcc=ccbca
aacbcbc=cacbcc

Up:	Monoids with two generators and one relation
Prev:	#1970 ⟨a, b \| aababbaa=ab⟩
Next:	#1972 ⟨a, b \| aababbaa=bb⟩

#1971 ⟨a, b | aababbaa=ba⟩

Properties

Complete rewriting system

Right Cayley graph (truncated)

Left Cayley graph (truncated)