NP-completeness of special string editing problems

We establish the NP-completeness of the string editing problems with respect to a language defined by restrictions on a subwords of its words. The editing operations consists in a replacement of the substrings belonging to a specified block code, by the words of another block code.