Blog

A semigroup presentation $ \langle A | R\rangle$ is called a tree-like if every relation has the form $ ab=c$ , $ a,b,c$ are in $ A$ and if two relations $ ab=c, a’b’=c’$ belong to $ R$ , then $ c=c’$ if and only if $ a=a’$ and $ b=b’$ . Example: $ P=\langleRead more