Minimal rewriting system

Definition
A minimal rewriting system is a complete rewriting system with the following additional properties:


 * The right side of every rewrite is an irreducible word
 * If $$(l_1,r_1),(l_2,r_2) \in R$$ then $$l_1$$ is not a subword of $$l_2$$